Commit f3ff6c4

author

zhunago

committed

in post and pre order iterativelly

1 parent 06dc103 commit f3ff6c4Copy full SHA for f3ff6c4

File tree

+123

-0

lines changed

+123

-0

lines changed

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+#include <iterator>`
	`2`	`+#include <algorithm>`
	`3`	`+#include <stack>`
	`4`	`+#include <vector>`
	`5`	`+`
	`6`	`+using namespace std;`
	`7`	`+`
	`8`	`+struct TreeNode {`
	`9`	`+ int val;`
	`10`	`+ TreeNode *left;`
	`11`	`+ TreeNode *right;`
	`12`	`+ TreeNode(int x) : val(x), left(NULL), right(NULL) {}`
	`13`	`+};`
	`14`	`+`
	`15`	`+class Solution {`
	`16`	`+public:`
	`17`	`+ vector<int> postorderTraversal(TreeNode* root) {`
	`18`	`+ vector<int> result;`
	`19`	`+ if(root == NULL) return result;`
	`20`	`+ stack<TreeNode *> st;`
	`21`	`+`
	`22`	`+ TreeNode *index = root;`
	`23`	`+`
	`24`	`+ while(!st.empty()\|\|index != NULL)`
	`25`	`+ {`
	`26`	`+ if(index != NULL)`
	`27`	`+ {`
	`28`	`+ st.push(index);`
	`29`	`+ index = index->left;`
	`30`	`+ }`
	`31`	`+ else`
	`32`	`+ {`
	`33`	`+ TreeNode *n = st.top();`
	`34`	`+ st.pop();`
	`35`	`+ result.push_back(index->val);`
	`36`	`+ index = n->right;`
	`37`	`+ }`
	`38`	`+ }`
	`39`	`+ return result;`
	`40`	`+ }`
	`41`	`+};`

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+#include <iterator>`
	`2`	`+#include <algorithm>`
	`3`	`+#include <stack>`
	`4`	`+#include <vector>`
	`5`	`+`
	`6`	`+using namespace std;`
	`7`	`+`
	`8`	`+struct TreeNode {`
	`9`	`+ int val;`
	`10`	`+ TreeNode *left;`
	`11`	`+ TreeNode *right;`
	`12`	`+ TreeNode(int x) : val(x), left(NULL), right(NULL) {}`
	`13`	`+};`
	`14`	`+`
	`15`	`+class Solution {`
	`16`	`+public:`
	`17`	`+ vector<int> postorderTraversal(TreeNode* root) {`
	`18`	`+ vector<int> result;`
	`19`	`+ stack<TreeNode *> st;`
	`20`	`+`
	`21`	`+ TreeNode *index = root;`
	`22`	`+`
	`23`	`+ while(!st.empty()\|\|index != NULL)`
	`24`	`+ {`
	`25`	`+ if(index != NULL)`
	`26`	`+ {`
	`27`	`+ st.push(index);`
	`28`	`+ result.push_back(index->val);`
	`29`	`+ index = index->right;`
	`30`	`+ }`
	`31`	`+ else`
	`32`	`+ {`
	`33`	`+ TreeNode *n = st.top();`
	`34`	`+ st.pop();`
	`35`	`+ index = n->left;`
	`36`	`+ }`
	`37`	`+ }`
	`38`	`+ reverse(result.begin(), result.end());`
	`39`	`+ return result;`
	`40`	`+ }`
	`41`	`+};`

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+#include <iterator>`
	`2`	`+#include <algorithm>`
	`3`	`+#include <stack>`
	`4`	`+#include <vector>`
	`5`	`+`
	`6`	`+using namespace std;`
	`7`	`+`
	`8`	`+struct TreeNode {`
	`9`	`+ int val;`
	`10`	`+ TreeNode *left;`
	`11`	`+ TreeNode *right;`
	`12`	`+ TreeNode(int x) : val(x), left(NULL), right(NULL) {}`
	`13`	`+};`
	`14`	`+`
	`15`	`+class Solution {`
	`16`	`+public:`
	`17`	`+ vector<int> postorderTraversal(TreeNode* root) {`
	`18`	`+ vector<int> result;`
	`19`	`+ if(root == NULL) return result;`
	`20`	`+ stack<TreeNode *> st;`
	`21`	`+`
	`22`	`+ TreeNode *index = root;`
	`23`	`+`
	`24`	`+ while(!st.empty()\|\|index != NULL)`
	`25`	`+ {`
	`26`	`+ if(index != NULL)`
	`27`	`+ {`
	`28`	`+ st.push(index);`
	`29`	`+ result.push_back(index->val);`
	`30`	`+ index = index->left;`
	`31`	`+ }`
	`32`	`+ else`
	`33`	`+ {`
	`34`	`+ TreeNode *n = st.top();`
	`35`	`+ st.pop();`
	`36`	`+ index = n->right;`
	`37`	`+ }`
	`38`	`+ }`
	`39`	`+ return result;`
	`40`	`+ }`
	`41`	`+};`

Comments

(0)