LeetCode Binary Tree Preorder Traversal

最新推荐文章于 2023-01-07 18:22:25 发布

勤奋的重剑

最新推荐文章于 2023-01-07 18:22:25 发布

阅读量260

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/jsh0123/article/details/50625059

版权

LeetCode 专栏收录该内容

59 篇文章 0 订阅

订阅专栏

C语言，递归算法。

/**
 * 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 *nums=NULL,i=0;
void preorder(struct TreeNode* root)
{   
    nums = (int *)realloc(nums, sizeof(int)*(i+1));
    if(root){
        nums[i++]=root->val;
        preorder(root->left);
        preorder(root->right);
    }
}

int* preorderTraversal(struct TreeNode* root, int* returnSize) {
    i=0;
    if(!root)
        return NULL;
    else{
        
        nums=(int *)malloc(sizeof(int));
        preorder(root);
        *returnSize=i;
        return nums;
    }
}

非递归算法。

/**
 * 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* preorderTraversal(struct TreeNode* root, int* returnSize) {
    struct TreeNode** stack=NULL,*pre=root;  
    *returnSize=0;  
    int i=0,j=0,*nums=NULL;  
    stack = (struct TreeNode **)malloc(sizeof(struct TreeNode *));  
    nums = (int *)malloc((j+1)*sizeof(int));  
    while(i||pre)  
    {  
        if(pre){
            nums = (int *)realloc(nums, sizeof(int)*(j+1));  
            nums[j++]=pre->val;  
            *returnSize+=1; 
            stack = (struct TreeNode **)realloc(stack, sizeof(struct TreeNode *)*i+1);  
            stack[i++]=pre;  
            pre=pre->left;  
        }  
        else{  
            pre=stack[--i];  
            pre=pre->right;  
        }  
    }  
    return nums;  
}

这两种方法，我基本没怎么改代码，相比于中序遍历，只是更改了读数据的顺序，具体可以细细品味。

2016/2/2