二叉树的遍历
class Solution:
def preorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
result = []
def recursion(node):
if node == None:
return
result.append(node.val)
recursion(node.left)
recursion(node.right)
recursion(root)
return result
class Solution:
def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
result = []
def recursion(node):
if node == None:
return
recursion(node.left)
recursion(node.right)
result.append(node.val)
recursion(root)
return result
class Solution:
def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
result = []
def recursion(node):
if node == None:
return
recursion(node.left)
result.append(node.val)
recursion(node.right)
recursion(root)
return result