【编程】二叉树的遍历汇总 文章目录 【编程】二叉树的遍历汇总 1. 前序遍历 2. 中序遍历 3. 后序遍历 4. 层次遍历 1. 前序遍历 递归: # 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: def preorderTraversal(self, root: Optional[