【20250215】二叉树：145.二叉树的后序遍历
class Solution:
def postorderTraversal(self,root):
res=[]
#dfs是指深度优先搜索
def dfs(node):
if node is None:
return
dfs(node.left)
dfs(node.right)
res.append(node.val)
dfs(root)
return res
class Solution:
def postorderTraversal(self,root):
res=[]
#dfs是指深度优先搜索
def dfs(node):
if node is None:
return
dfs(node.left)
dfs(node.right)
res.append(node.val)
dfs(root)
return res