Binary Tree Preorder Traversal
题目描述:
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?
题目分析:先跟遍历,简单不过。
1递归方法:
public ArrayList<Integer> preorderTraversal(TreeNode root) {
ArrayList<Integer> array=new ArrayList<Integer>();
if(root==null)
return array;
array.add(root.val);
ArrayList<Integer> left=preorderTraversal(root.left);
ArrayList<Integer> right=preorderTraversal(root.right);
array.addAll(left);
array.addAll(right);
return array;
}
2 非递归方法:
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list=new ArrayList<Integer>();
Stack<TreeNode>stack=new Stack<TreeNode>();
if(root!=null){
stack.add(root);
while(!stack.isEmpty()){
TreeNode node=stack.pop();
list.add(node.val);
if(node.right!=null){
stack.add(node.right);
}
if(node.left!=null){
stack.add(node.left);
}
}
}
return list;
}