Commit 2c7f641

committed

Iterative Traversal of Inorder Traversal of the Binary Tree

1 parent 91d9195 commit 2c7f641Copy full SHA for 2c7f641

File tree

+38

-0

lines changed

+38

-0

lines changed

Lines changed: 38 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,38 @@`
	`1`	`+#include <bits/stdc++.h>`
	`2`	`+using namespace std;`
	`3`	`+`
	`4`	`+struct TreeNode{`
	`5`	`+ int data;`
	`6`	`+ TreeNode* left;`
	`7`	`+ TreeNode* right;`
	`8`	`+`
	`9`	`+ TreeNode(int val){`
	`10`	`+ data = val;`
	`11`	`+ left = right = NULL;`
	`12`	`+ }`
	`13`	`+`
	`14`	`+};`
	`15`	`+vector<int> inOrderTraversal(TreeNode* root){`
	`16`	`+ stack<TreeNode*> st;`
	`17`	`+ TreeNode* node = root;`
	`18`	`+ vector<int> inorder;`
	`19`	`+ while(true){`
	`20`	`+ if(node!=NULL){`
	`21`	`+ st.push(node);`
	`22`	`+ node = node->left;`
	`23`	`+ }`
	`24`	`+ else{`
	`25`	`+ if(st.empty()==true) break;`
	`26`	`+ node = st.top();`
	`27`	`+ st.pop();`
	`28`	`+ inorder.push_back(node->data);`
	`29`	`+ node = node->right;`
	`30`	`+ }`
	`31`	`+ }`
	`32`	`+ return inorder;`
	`33`	`+}`
	`34`	`+`
	`35`	`+//In this Part we will try to fo Itertive Traversal of the Tree without using recursion`
	`36`	`+int main(){`
	`37`	`+`
	`38`	`+}`

Comments

(0)