题目大意:中序遍历二叉树
分析:栈的应用,考察二叉树的中序遍历。
代码:
/**
* 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) {
if(!root) return {};
vector<int> inorder;
stack<TreeNode*> s;
TreeNode* p = root;
while(p || !s.empty()){
while(p){
s.push(p);
p = p->left;
}
p = s.top();
s.pop();
inorder.push_back(p->val);
p = p->right;
}
return inorder;
}
};