给定一个二叉树的根节点 root ,返回它的 中序 遍历。
示例 1:
输入:root = [1,null,2,3]
输出:[1,3,2]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [1]
输出:[1]
示例 4:
输入:root = [1,2]
输出:[2,1]
示例 5:
输入:root = [1,null,2]
输出:[1,2]
链接:https://leetcode-cn.com/problems/binary-tree-inorder-traversal
class Solution:
def inorderTraversal(self, root:TreeNode) -> List[int]:
white, Gary = 0, 1
res = []
stack = [(white, root)]
while stack != []:
color, node = stack.pop()
if node == None:
continue
if color == white:
stack.append((white, node.right))
stack.append((Gray, node))
stack.append((white, node.left))
else:
stack.append(node.val)
return res
Leetcode 94.二叉树的中序遍历 (每日一题 20210712)
最新推荐文章于 2022-02-05 00:15:44 发布