树刷题记录

解法：遍历树的左右节点，然后比较大小在+1。

int TreeDepth(struct TreeNode* pRoot ) {
    // write code here
    int treeDeepth = 0;
    int ldeep,rdeep,maxdeep;
    if(pRoot==NULL)
        return 0;
    ldeep = TreeDepth(pRoot->left);
    rdeep = TreeDepth(pRoot->right);
    treeDeepth = ldeep>rdeep?ldeep+1:rdeep+1;
    return treeDeepth;   
}

int* PrintFromTopToBottom(struct TreeNode* root, int* returnSize ) {
    // write code here
    if(root  == NULL){
        *returnSize = 0;
        return NULL;
    }
        
    int result[1000];
    struct TreeNode *nodes[1000];
    nodes[0] = root;
    for(int i = 0;i<=(*returnSize);i++){
        if(nodes[i]->left)
            nodes[++(*returnSize)] = nodes[i]->left;
            
        if(nodes[i]->right)
            nodes[++(*returnSize)] = nodes[i]->right;       
        
        result[i] = nodes[i]->val;
    }
        (*returnSize)++;
    return result;
}