题解 | #二叉树的后序遍历#
二叉树的后序遍历
http://www.nowcoder.com/practice/1291064f4d5d4bdeaefbf0dd47d78541
int arr[100]= {0};
int cnt = 0;
void printtree(struct TreeNode* p){
if(p == NULL)
return;
printtree(p->left);
printtree(p->right);
arr[cnt++] = p->val;
}
int* postorderTraversal(struct TreeNode* root, int* returnSize ) {
printtree(root);
*returnSize = cnt;
return arr;
}
