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?
/**
* 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> vector;
stack<TreeNode *> stack;
TreeNode *pCurrent = root;
while(!stack.empty() || pCurrent)
{
if(pCurrent) //存在节点则向左节点方向寻找
{
stack.push(pCurrent); //将左节点全部压入
pCurrent = pCurrent->left;
}
else
{ //左节点全部寻毕完成,保存当前节点,开始寻找右节点
TreeNode *pNode = stack.top();
vector.push_back(pNode->val);
stack.pop();
pCurrent = pNode->right;
}
}
return vector;
}
};