leetcode - Binary Tree Inorder Traversal

题目：

二叉树的中序遍历

递归解法：

public ArrayList<Integer> inorderTraversal(TreeNode root){
	ArrayList<Integer> res = new ArrayList<Integer>();
	helper(root, res);
	return res;
}

private void helper(TreeNode root, ArrayList<Integer> res){
	if(root == null)
		return;
	helper(root.left, res);
	res.add(root.val);
	helper(root.right, res);
}

非递归解法：

public ArrayList<Integer> inorderTraversal(TreeNode root){
	ArrayList<Integer> res = new ArrayList<Integer>();
	Stack<TreeNode> stack = new Stack<TreeNode>();  

	while(root != null || !stack.isEmpty()){
		if(root != null){
			stack.push(root);
			root = root.left;
		}
		else{
			root = stack.pop();
			res.add(root.val);
			root = root.right;
		}
	}
	return res;
}