树-144. 二叉树的前序遍历-PYTHON

递归+迭代

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

class Solution(object):
    def preorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        ################迭代#################
        if not root:
            return []
        
        lstack = []
        rstack = []
        res = []
        lstack.append(root)
        while lstack or rstack:
            if lstack:
                tmp = lstack.pop(0)
            elif rstack:
                tmp = rstack.pop()
            res.append(tmp.val)
            if tmp.left:
                lstack.append(tmp.left)
            if tmp.right:
                rstack.append(tmp.right)
        return res


        

        ###############递归####################
        if not root:
            return []
        res = list()
        def helper(node):
            res.append(node.val)
            if node.left:
                helper(node.left)
            if node.right:
                helper(node.right)
        
        helper(root)
        return res