Given a binary tree, return the preorder traversal of its nodes' values.
For example: Given binary tree {1,#,2,3}
,
1
\
2
/
3
return [1,2,3]
.
Note: Recursive solution is trivial, could you do it iteratively?
题目大意:先序遍历二叉树。
解题思路:
解法一:递归。代码如下:(1ms,beats 28.88%)
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1 ,#, 2 , 3 }, 1 \ 2 / 3 return [ 1 , 2 , 3 ]. Note: Recursive solution is trivial, could you do it iteratively?
解法二:循环。代码如下:(1ms,beats 28.88%)
public class Solution { public List<Integer> preorderTraversal(TreeNode root) { List<Integer> list = new ArrayList<>(); if (root == null ) return list; TreeNode[] stack = new TreeNode[ 1000 ]; int index=- 1 ; while (root!= null || index>= 0 ){ if (root!= null ){ list.add(root.val); stack[++index] = root; root = root.left; }else { root = stack[index--].right; } } return list; } }