/**
* 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 == nullptr)
return res;
stack<TreeNode*> stk_node;
stk_node.push(root);
while(!stk_node.empty())
{
TreeNode *node = stk_node.top();
res.push_back(node->val);
stk_node.pop();
if(node->right != nullptr)
stk_node.push(node->right);
if(node->left != nullptr)
stk_node.push(node->left);
}
return res;
}
};