题目:
给定一个二叉树,返回它的 后序 遍历。
Given a binary tree, return the postorder traversal of its nodes' values.
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [3,2,1]
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
Follow up: Recursive solution is trivial, could you do it iteratively?
解题思路:
遍历顺序:右子节点 --> 根节点 --> 左子节点
如下所示的二叉树:
A
/ \
B C
/ \ / \
D E F G
其遍历顺序为:D -> E -> B -> F -> G -> C-> A
类似 N 叉树那种, 两种思路: 递归和迭代, 很简单, 类似的题目可以参考:2
LeetCode 589: N 叉树的前序遍历 N-ary Tree Preorder Traversal
LeetCode 590: N 叉树的后序遍历 N-ary Tree Postorder Traversal
LeetCode 429: N 叉树的层序遍历 N-ary Tree Level Order Traversal
递归法:
Java:
class Solution {
List<Integer> res =new ArrayList<>();
public List<Integer> postorderTraversal(TreeNode root) {
postorderHelper(root);
return res;
}
private void postorderHelper(TreeNode root){
if(root==null)return;
postorderHelper(root.left);
postorderHelper(root.right);
res.add(root.val);
}
}
Python:
class Solution:
def postorderTraversal(self, root: TreeNode) -> List[int]:
res=[]
def postorderHelper(root):
if not root:return res
postorderHelper(root.left)
postorderHelper(root.right)
res.append(root.val)
postorderHelper(root)
return res
迭代法:
迭代法时可以像前序中序那种, 不过需要改很多. 下面这种方法更巧妙:
从根节点开始依次迭代,弹出栈顶元素输出到输出列表中,然后依次压入它的所有孩子节点,按照从上到下、从左至右的顺序依次压入栈中。最后将输出列表逆序输出
Java:
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
Stack<TreeNode> stack = new Stack<>(); // 初始化栈
LinkedList<Integer> res = new LinkedList<>(); // 初始化输出结果
if (root == null) {
return res;
}
stack.add(root);
while (!stack.isEmpty()) {
TreeNode node = stack.pop();
res.addFirst(node.val); // 添加在头部, 最后无需再反转
if (node.left != null) {
stack.add(node.left);
}
if (node.right != null) {
stack.add(node.right);
}
}
return res;
}
}
Python:
class Solution:
def postorderTraversal(self, root: TreeNode) -> List[int]:
# 初始化数组、栈
res, stack = [], [root]
if not root:
return res
# 递归条件为:栈或当前节点非空
while stack:
node = stack.pop()
res.append(node.val)
if node.left: stack.append(node.left)
if node.right: stack.append(node.right)
return res[::-1] # 输出反转后的数组