题解 | #二叉树的后序遍历#
二叉树的后序遍历
https://www.nowcoder.com/practice/1291064f4d5d4bdeaefbf0dd47d78541
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
#
class Solution:
def postorderTraversal(self, root: TreeNode) -> List[int]:
# write code here
if not root:
return []
res = []
def dfs(node: TreeNode):
if node.left:
dfs(node.left)
if node.right:
dfs(node.right)
res.append(node.val)
dfs(root)
return res
查看24道真题和解析
