/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> preorderTraversal(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> preorder;
if (!root) {
return preorder;
}
stack<TreeNode *> s;
s.push(root);
TreeNode *cur;
while (!s.empty()) {
cur = s.top();
s.pop();
preorder.push_back(cur->val);
if (cur->right) {
s.push(cur->right);
}
if (cur->left) {
s.push(cur->left);
}
}
return preorder;
}
};
LeetCode Binary Tree Preorder Traversal
最新推荐文章于 2020-12-22 10:20:16 发布