非递归版本
递归版本
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<Integer>();
preorder(list,root);
return list;
}
public void preorder(List<Integer> list ,TreeNode root){
if(root==null)
return;
list.add(root.val);
preorder(list,root.left);
preorder(list,root.right);
}
}
ps:
原来前,后,中序遍历,属于深度优先遍历。
那么按照深度优先遍历,前序遍历还可以这样写:
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<Integer>();
Deque<TreeNode> stack = new LinkedList<TreeNode>();
if(root!=null)
stack.push(root);
while(!stack.isEmpty()){
TreeNode popnode = stack.pop();
list.add(popnode.val);
if(popnode.right!=null)
stack.push(popnode.right);
if(popnode.left!=null)
stack.push(popnode.left);
}
return list;
}
}