leetcode_22_二叉树的前序遍历

最新推荐文章于 2024-09-27 15:30:00 发布

weixin_52872520

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量53

点赞数

分类专栏： leetcode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_52872520/article/details/131091755

版权

leetcode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int TreeSize(struct TreeNode* root)
{
    return root == NULL ? 0 : TreeSize(root->left) + TreeSize(root->right) + 1; 
}

void preorder(struct TreeNode* root,int* a,int* pi)
{
    if(root == NULL)
        return;

    a[(*pi)++] = root->val;
    preorder(root->left,a,pi);
    preorder(root->right,a,pi);
}
int* preorderTraversal(struct TreeNode* root, int* returnSize){
    *returnSize = TreeSize(root);
    int* a = (int*)malloc(*returnSize*sizeof(int));
    int i = 0;
    preorder(root,a,&i);

    return a;
}