题目
Given a binary tree, return the preorder traversal of its nodes’ values.
Have you met this question in a real interview?
Yes
Example
Given:
1
/ \
2 3
/ \
4 5
return [1,2,4,5,3].
Challenge
Can you do it without recursion?
Tags
Recursion Binary Tree Binary Tree Traversal Non Recursion
思路
非递归。
代码
"""
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
self.val = val
self.left, self.right = None, None
"""
class Solution:
"""
@param: root: A Tree
@return: Preorder in ArrayList which contains node values.
"""
def preorderTraversal(self, root):
# write your code here
res_list = []
stack = []
if root: stack.append(root)
while stack:
node = stack[-1]
stack.pop(-1)
res_list.append(node.val)
if node.right: stack.append(node.right)
if node.left: stack.append(node.left)
return res_list