# class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None
class(object): defpreorderTraversal(self, root): """ :type root: TreeNode :rtype: List[int] """ ifnot root: return [] result, stack = [], [] p = root while stack or p: if p: result.append(p.val) stack.append(p.right) p = p.left else: p = stack.pop() return result
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
class : defpreorderTraversal(self, root: TreeNode) -> List[int]: ifnot root: return [] stack, result = [root], [] while stack: p = stack.pop() result.append(p.val) if p.right: stack.append(p.right) if p.left: stack.append(p.left) return result
近期评论