Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,3,2]
.
Note: Recursive solution is trivial, could you do it iteratively?
递归很无聊,我就用的递归。package leetcode;
import java.util.ArrayList;
import java.util.List;
public class Binary_Tree_Inorder_Traversal_94 {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list=new ArrayList<Integer>();
inorder(root, list);
return list;
}
public void inorder(TreeNode node,List<Integer> list){
if(node==null){
return;
}
inorder(node.left, list);
list.add(node.val);
inorder(node.right, list);
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Binary_Tree_Inorder_Traversal_94 b=new Binary_Tree_Inorder_Traversal_94();
TreeNode root=new TreeNode(1);
root.right=new TreeNode(2);
root.right.left=new TreeNode(3);
List<Integer> list=b.inorderTraversal(root);
for(Integer i:list){
System.out.print(i+" ");
}
}
}
此外,我也用迭代做了一遍。
public void testInorder(TreeNode node){
Stack<TreeNode> stack=new Stack<TreeNode>();
stack.push(node);
while(node.left!=null){
node=node.left;
stack.push(node);
}
while(!stack.isEmpty()){
node=stack.pop();
System.out.println(node.val);
if(node.right!=null){
node=node.right;
stack.push(node);
while(node.left!=null){
node=node.left;
stack.push(node);
}
}
}
}
大神跟我思路类似,不过比我简洁。while(...left...)只写了一遍,比较巧妙。
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode cur = root;
while(cur!=null || !stack.empty()){
while(cur!=null){
stack.add(cur);
cur = cur.left;
}
cur = stack.pop();
list.add(cur.val);
cur = cur.right;
}
return list;
}