给定一个二叉树,返回它的 后序 遍历。
示例:
输入: [1,null,2,3]
1
2
/
3
输出: [3,2,1]
链接:https://leetcode-cn.com/leetbook/read/data-structure-binary-tree/xebrb2/
方法一:递归
知识点:
二叉树根节点的值:root.val
二叉树的左子树:root.left
二叉树的右子树:root.right
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def postorderTraversal(self, root: TreeNode) -> List[int]:
result = []
def postorder(root):
if root == None:
return result
postorder(root.left)
postorder(root.right)
result.append(root.val)
postorder(root)
return result
方法一:迭代