leetcode 94. Binary Tree Inorder Traversal

来源:互联网 发布:广西网络培训网 编辑:程序博客网 时间:2024/06/06 17:34
class Solution {public:vector<int> inorderTraversal(TreeNode* root){vector<int> res;stack<TreeNode*> stack;TreeNode*p=root;if (!root){return res;}while (!stack.empty() || p){if (p){stack.push(p);p = p->left;}else{TreeNode* temp = stack.top();stack.pop();res.push_back(temp->val);p = temp->right;}}return res;}};

0 0