题目:
二叉树的先序遍历
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].
递归解法:
public List<Integer> preorderTraversal(TreeNode root){
List<Integer> res = new ArrayList<Integer> ();
helper(root, res);
return res;
}
private void helper(TreeNode root, List<Integer> res){
if(root == null)
return;
res.add(root.val);
helper(root.left, res);
helper(root.right, res);
}
非递归解法:
public List<Integer> preorderTraversal(TreeNode root){
List<Integer> res = new ArrayList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
while(root != null || !stack.isEmpty()){
if(root != null){
stack.push(root);
res.add(root.val);
root = root.left;
}
else{
root = stack.pop();
root = root.right;
}
}
return res;
}