94. Binary Tree Inorder Traversal

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

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

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

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
	vector<int> inorderTraversal(TreeNode* root) {
		vector<int> ans;
		if (root == NULL) return  ans; 
	//	inorderVisit(root, ans);  
		NoInRecursiveVist(root, ans);
		return ans; 
	}

	//递归中序遍历
	void inorderVisit(TreeNode  *root, vector<int> & ans)
	{
		if (root == NULL) return;
		if (root->left != NULL)
			inorderVisit(root->left, ans);
		ans.push_back(root->val);
		if (root->right != NULL)
			inorderVisit(root->right, ans);

	}

	//非递归中序遍历  
	void NoInRecursiveVist(TreeNode * T , vector<int> & ans )
	{
		stack <TreeNode * > S;
		TreeNode* p;
		p = T;
		while (!S.empty() || p)
		{
			if (p)
			{
				S.push(p);
				p = p->left;
			}
			else
			{
				p = S.top();
				S.pop();
				ans.push_back(p->val);
				p = p->right;
			}

		}
	}


};