LeetCode解题心得——二叉树前序遍历（python）

题目

给定一个二叉树，返回它的 前序 遍历。

思路

1.递归

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def __init__(self):
        self.ans = []
    def preorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return []
        self.ans.append(root.val)
        self.preorderTraversal(root.left)
        self.preorderTraversal(root.right)
        return self.ans

2.迭代

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def __init__(self):
        self.stack = []
        self.ans = []
        
    def preorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return []
        self.stack.append(root)
        while self.stack:
            cur = self.stack.pop()
            self.ans.append(cur.val)
            if cur.right:
                self.stack.append(cur.right)
            if cur.left:
                self.stack.append(cur.left)
        return self.ans