遍历方法思路整理"/>
二叉树三种遍历方法思路整理
前序遍历
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = Noneclass Solution:def preorderTraversal(self, root: TreeNode) -> List[int]:p = rootstack, out = [], []while p or stack:if p:out.append(p.val
更多推荐
二叉树三种遍历方法思路整理
发布评论