144. Binary Tree Preorder Traversal

最新推荐文章于 2019-03-30 14:59:52 发布

小雨润如酥

最新推荐文章于 2019-03-30 14:59:52 发布

阅读量175

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/zhaihaixu/article/details/79526585

版权

leetcode 专栏收录该内容

120 篇文章 1 订阅

订阅专栏

前序遍历

/**
* 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) {
int *A(struct TreeNode* , int* ,int* );
int* returnlist;
returnlist=(int*)malloc(sizeof(int)*2000);
A(root,returnSize,returnlist);
return returnlist;
}
int *A(struct TreeNode* root, int* returnSize,int* returnlist)
{
if(root==NULL)
return NULL;
*(returnlist+*returnSize)=root->val;
(*returnSize)++;
A(root->left,returnSize,returnlist);
A(root->right,returnSize,returnlist);
return NULL;
}