中序遍历
左、根、右
Python3代码
# 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 inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
res = [] # 定义一个数组用于存放检索到的节点
self.middleorderTraversal(root,res) # 调用middleorderTraversal()函数
return res #返回res数组
# 定义middleorderTraversal(),root:二叉树,res:数组
def middleorderTraversal(self, root, res):
if root == None:
return
self.middleorderTraversal(root.left, res)
res.append(root.val) # 中序遍历
self.middleorderTraversal(root.right, res)
return res