二叉树

1.二叉树的中序遍历： 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: global ans = [] def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]: if not root: return [] self.inorderTraversal(root.left) ans.append(root.val) self.inorderTraversal(root.right) return ans 2.二叉树的最大深度： 递递的归 ...