中序遍历:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode p = root;
while(!stack.isEmpty() || p != null){
if(p != null){
stack.push(p);
p = p.left;
}
else{
p = stack.peek();
list.add(p.val);
stack.pop();
p = p.right;
}
}
return list;
}
}