|
| 1 | +// Solution to Binary Tree Inorder Traversal - Problem No. : 94 |
| 2 | +/** |
| 3 | + * Definition for a binary tree node. |
| 4 | + * struct TreeNode { |
| 5 | + * int val; |
| 6 | + * TreeNode *left; |
| 7 | + * TreeNode *right; |
| 8 | + * TreeNode() : val(0), left(nullptr), right(nullptr) {} |
| 9 | + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} |
| 10 | + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} |
| 11 | + * }; |
| 12 | + */ |
| 13 | +class Solution { |
| 14 | +public: |
| 15 | + vector<int> inorderTraversal(TreeNode* root) { |
| 16 | + stack<TreeNode*> s; |
| 17 | + vector<int> res; |
| 18 | + do{ |
| 19 | + while(root!=NULL){ |
| 20 | + s.push(root); |
| 21 | + root=root->left; |
| 22 | + } |
| 23 | + if(!s.empty()){ |
| 24 | + root=s.top(); |
| 25 | + s.pop(); |
| 26 | + res.push_back(root->val); |
| 27 | + root=root->right; |
| 28 | + } |
| 29 | + }while(root!=NULL||!s.empty()); |
| 30 | + return res; |
| 31 | + } |
| 32 | +}; |
| 33 | +// This code is created by - Swapnil0803 |
0 commit comments