题目:
给你二叉树的根节点 root ,返回它节点值的 前序 遍历。
示例:
思路:递归,或者借助栈迭代实现
递归很好写,不多说。
借助栈的迭代:
- 若根节点不为空,存储根节点的值,把节点的右子树压栈,根节点移向左子树;
- 若根节点为空,从栈里弹出一个元素,重复上述步骤。
代码:递归
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def preorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
def preorderOutput(root, res):
if root:
res.append(root.val)
if root.left:
preorderOutput(root.left, res)
if root.right:
preorderOutput(root.right, res)
res = []
preorderOutput(root, res)
return res
代码:迭代
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def preorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
res = []
stack = []
while root or stack:
if not root:
root = stack.pop()
res.append(root.val)
if root.right:
stack.append(root.right)
root = root.left
return res