/**
* 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)
{
vector<int> vect;
if(root==NULL)
{
return vect;
}
stack<TreeNode *>stk;
if(root!=NULL)
{
stk.push(root);
while(!stk.empty())
{
root=stk.top();
stk.pop();
vect.push_back(root->val);
if(root->right)
{
stk.push(root->right);
}
if(root->left)
{
stk.push(root->left);
}
}
}
return vect;
}
};
* 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)
{
vector<int> vect;
if(root==NULL)
{
return vect;
}
stack<TreeNode *>stk;
if(root!=NULL)
{
stk.push(root);
while(!stk.empty())
{
root=stk.top();
stk.pop();
vect.push_back(root->val);
if(root->right)
{
stk.push(root->right);
}
if(root->left)
{
stk.push(root->left);
}
}
}
return vect;
}
};