Inorder Traversal Practice
vector<int> v;
vector<int> inorderTraversal(TreeNode* root) {
if(root==NULL)
return v;
v=inorderTraversal(root->left);
v.push_back(root->val);
v=inorderTraversal(root->right);
return v;
}
vector<int> inOrder(Node* root) {
vector<int> v;
Node* node=root;
stack<Node*> s;
while(true)
{
if(node!=NULL)
{
s.push(node);
node=node->left;
}
else
{
if(s.empty())
break;
node=s.top();
s.pop();
v.push_back(node->data);
node=node->right;
}
}
return v;
}
```