1、前序遍历
1)递归
/**
* 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 {
List<Integer> result;
public List<Integer> preorderTraversal(TreeNode root) {
result=new ArrayList<Integer>();
preOrderTraverse(root);
return result;
}
public void preOrderTraverse(TreeNode root)
{
if(root==null)
return;
result.add(root.val);
preOrderTraverse(root.left);
preOrderTraverse(root.right);
}
}
2)非递归
入栈时压值
/**
* Definition for a binary