Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes’ values.

Example
Given:

    1
   / \
  2   3
 / \
4   5

return [1,2,4,5,3].

Python:

    """
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
    self.val = val
    self.left, self.right = None, None
"""


class Solution:
"""
@param root: The root of binary tree.
@return: Preorder in ArrayList which contains node values.
"""
'''
# divide and conquer
def preorderTraversal(self, root):
    result = []
    if root is None:
        return result

    left = self.preorderTraversal(root.left)
    right = self.preorderTraversal(root.right)

    result.append(root.val)
    result.extend(left)
    result.extend(right)
    return result
'''

'''
# Traverse
def preorderTraversal(self, root):
    result = []
    self.helper(root, result)
    return result

def helper(self, root, result):
    if root is None:
        return
    result.append(root.val)
    if root.left:
        self.helper(root.left, result)
    if root.right:
        self.helper(root.right, result)
'''

# non-recursion
def preorderTraversal(self, root):
    if root is None:
        return []
    stack = [root]
    preorder = []
    while stack:
        node = stack.pop()
        preorder.append(node.val)
        if node.right:
            stack.append(node.right)
        if node.left:
            stack.append(node.left)
    return preorder