/**
* 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> preorderTraversal(TreeNode* root)
{
vector<int> res;
if(root==NULL)
return res;
else
{
stack<TreeNode*> s;
s.push(root);
while(!s.empty())
{
TreeNode* temp=s.top();
res.push_back(temp->val);
s.pop();
if(temp->right)
s.push(temp->right);
if(temp->left)
s.push(temp->left);
}
return res;
}
}
};
Binary Tree Preorder Traversal
最新推荐文章于 2024-01-25 21:49:27 发布