一、 DFS遍历
DFS遍历(深度优先搜索)包括中序、先序、后序搜索
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 zhongxu(self, root: TreeNode) -> List[int]:
a = []
def dfs(root):
if not root:
return list()
dfs(root.left)
a.append(root.val)
dfs(root.right)
dfs(root)
return a