Commit07d09a0

committed

add a solution for 173

1 parent76d2c52 commit07d09a0Copy full SHA for 07d09a0

File tree

+30

-0

lines changed

+30

-0

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@`
`2`	`2`
`3`	`3`	`importcom.fishercoder.common.classes.TreeNode;`
`4`	`4`
	`5`	`+importjava.util.Deque;`
`5`	`6`	`importjava.util.LinkedList;`
`6`	`7`	`importjava.util.Queue;`
`7`	`8`	`importjava.util.Stack;`
`@@ -74,4 +75,33 @@ public int next() {`
`74`	`75`	`}`
`75`	`76`	`}`
`76`	`77`	`}`
	`78`	`+`
	`79`	`+publicstaticclassSolution3 {`
	`80`	`+/**`
	`81`	`+ * credit: https://leetcode.com/problems/binary-search-tree-iterator/discuss/52647/Nice-Comparison-(and-short-Solution`
	`82`	`+ */`
	`83`	`+publicstaticclassBSTIterator {`
	`84`	`+Deque<TreeNode>stack;`
	`85`	`+TreeNodevisit;`
	`86`	`+`
	`87`	`+publicBSTIterator(TreeNoderoot) {`
	`88`	`+stack =newLinkedList<>();`
	`89`	`+visit =root;`
	`90`	`+ }`
	`91`	`+`
	`92`	`+publicintnext() {`
	`93`	`+while (visit !=null) {`
	`94`	`+stack.addLast(visit);`
	`95`	`+visit =visit.left;`
	`96`	`+ }`
	`97`	`+TreeNodenext =stack.pollLast();`
	`98`	`+visit =next.right;`
	`99`	`+returnnext.val;`
	`100`	`+ }`
	`101`	`+`
	`102`	`+publicbooleanhasNext() {`
	`103`	`+returnvisit !=null && !stack.isEmpty();`
	`104`	`+ }`
	`105`	`+ }`
	`106`	`+ }`
`77`	`107`	`}`

Comments

(0)