题目:
给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [1,3,2]
代码如下:
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root)
{
vector<int> midorder;
stack<TreeNode*> node;
TreeNode* p = root;
while (p || node.size())
{
while (p)
{
node.push(p);
p = p->left;
}
p = node.top();
node.pop();
midorder.push_back(p->val);
p = p->right;
}
return midorder;
}
};