leetcode[199]:Binary Tree Right Side View

最新推荐文章于 2020-04-04 21:56:32 发布

hahubaba

最新推荐文章于 2020-04-04 21:56:32 发布

阅读量278

点赞数

分类专栏： leetcode 文章标签： binary tree

本文链接：https://blog.csdn.net/hahubaba/article/details/47069967

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Binary Tree Right Side View

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

For example:
Given the following binary tree,

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

You should return [1, 3, 4].

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */


 int maxDepth(struct TreeNode* root) {

    int i, j;

    i=j=1;

    if(!root) return 0;
    if(root->left) i += maxDepth(root->left);
    if(root->right) j += maxDepth(root->right);

    if( i > j ) return i;

    return j;

}

int* rightSideView(struct TreeNode* root, int* returnSize) {
    int size[100];
    struct TreeNode stack[10000];
    int i,ress,j,k,l;
    int *result;

    l=maxDepth(root);

    if(!root) return NULL;
    result= (int*)malloc(sizeof(int*)*l);

    *returnSize = l;
    i=j=k=0;
    stack[0] = *root;
    size[0]=1;
    l=1;
    ress=1;
    while(l!=0)
    {
        l=0;
        for(j=0;j<size[i];j++)
        {
            if(stack[k+j].left) {l++;stack[ress++]=*stack[k+j].left; }
            if(stack[k+j].right) {l++;stack[ress++]=*stack[k+j].right;}
        }
        result[i]=stack[k+j-1].val;
        k += j;

        size[++i]=l;
    }
     return result;
}