/**
* 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().
*/
void postorder(struct TreeNode* proot,int* parr,int* size)
{
if(proot==NULL)
return;
postorder(proot->left,parr,size);
postorder(proot->right,parr,size);
parr[(*size)++]=proot->val;
}
int* postorderTraversal(struct TreeNode* root, int* returnSize) {
int* arr=(int*)malloc(sizeof(int)*2000);
* returnSize=0;
postorder(root,arr,returnSize);
return arr;
}
二叉树的后序遍历(力扣第145题)
最新推荐文章于 2024-10-11 22:20:00 发布