leetcode(十二)Binary Tree Inorder Traversal

copyright:leetcode

Given a binary tree, return the inorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [1,3,2].

Note: Recursive solution is trivial, could you do it iteratively?

1.递归版

/**
 * 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) {
		ArrayList<Integer> list = new ArrayList<Integer>();
		recur(list, root);
		
		return list;
    }
	private void recur(ArrayList<Integer> list, TreeNode tNode){
		if(tNode != null){
			recur(list, tNode.left);
			list.add(tNode.val);
			recur(list, tNode.right);
		}
	}
}

2.非递归版(详细参考http://www.cnblogs.com/dolphin0520/archive/2011/08/25/2153720.html)

/**
 * 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) {
		ArrayList<Integer> list = new ArrayList<Integer>();
		nonrecur(list, root);
		
		return list;
    }
	private void nonrecur(ArrayList<Integer> list, TreeNode root){
		Stack<TreeNode> stack = new Stack<TreeNode>();
		if(root != null){
			TreeNode pt = root;
			while(!stack.empty() || pt != null){
				while(pt != null){
					stack.push(pt);
					pt = pt.left;
				}
				if(!stack.empty()){
					pt = stack.pop();
					list.add(pt.val);
					pt = pt.right;
					//think about only 2 node(one is root, another is right child),stack is empty, while pt.right is not null
				}
			}
		}
	}
}