145. 二叉树的后序遍历
给你一棵二叉树的根节点 root ,返回其节点值的 后序遍历 。
示例 1:
输入:root = [1,null,2,3]
输出:[3,2,1]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [1]
输出:[1]
提示:
树中节点的数目在范围 [0, 100] 内
-100 <= Node.val <= 100
代码
递归
/**
* 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* root, int* res, int* returnSize) {
if (root == NULL)
return;
postOrder(root->left, res, returnSize);
postOrder(root->right, res, returnSize);
res[(*returnSize)++] = root->val;
}
int* postorderTraversal(struct TreeNode* root, int* returnSize){
int* res = (int*)malloc(sizeof(int) * 100);
*returnSize = 0;
postOrder(root, res, returnSize);
return res;
}
迭代
迭代的后序遍历就是前序遍历的改造版再倒序输出,因为前序遍历是中左右输出,所以把前序遍历改成中右左输出顺序,之后再取反就是左右中的后序遍历的顺序了
/*
* 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 reverse(int* arr, int len) {
int l = 0, r = len - 1, t;
while (l < r) {
t = arr[l];
arr[l] = arr[r];
arr[r] = t;
l++;
r--;
}
}
int* postorderTraversal(struct TreeNode* root, int* returnSize){
int* res = (int*)malloc(sizeof(int) * 100);
*returnSize = 0;
if (root == NULL) {
return res;
}
struct TreeNode* tree[100];
int top = 0;
tree[top++] = root;
while (top > 0) {
struct TreeNode* tt = tree[--top];
res[(*returnSize)++] = tt->val;//中
if (tt->left) tree[top++] = tt->left;//先入栈左节点,因为栈是先入后出的,左右入,就右左出
if (tt->right) tree[top++] = tt->right;
}
reverse(res, *returnSize);//returnSize 是一个指针,想传值要传*returnSize
//非常蠢的一直在用returnsize来当成数组长度来reserve,结果一直在WA
return res;
}