二叉树中序遍历 (非递归)
/**
* 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:
int countNodes(TreeNode* root) {
if(root==NULL)
{
return 0;
}
TreeNode* p=root;
vector<int> v;
stack<TreeNode*> s;
while(!s.empty()||p)
{
while(p)
{
s.push(p);
p=p->left;
}
if(!s.empty())
{
TreeNode* tmp=s.top();
s.pop();
v.push_back(tmp->val);
p=tmp->right;
}
}
return v.size();
}
};