Commit03eac5d

authored

Create 1609-even-odd-tree.java

1 parent6f8ff59 commit03eac5dCopy full SHA for 03eac5d

File tree

+36

-0

lines changed

+36

-0

lines changed

Lines changed: 36 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,36 @@`
	`1`	`+/*_____________________________`
	`2`	`+ Time Complexity: O(n)`
	`3`	`+ Space Complexity: O(n)`
	`4`	`+_______________________________*/`
	`5`	`+`
	`6`	`+classSolution {`
	`7`	`+publicbooleanisEvenOddTree(TreeNoderoot) {`
	`8`	`+Queue<TreeNode>q =newLinkedList<>();`
	`9`	`+q.add(root);`
	`10`	`+booleanevenLevel =true;`
	`11`	`+`
	`12`	`+while(!q.isEmpty()){`
	`13`	`+intprev = (evenLevel)?Integer.MIN_VALUE:Integer.MAX_VALUE;`
	`14`	`+intsz =q.size();`
	`15`	`+`
	`16`	`+for(inti =0;i <sz;i++){`
	`17`	`+TreeNodecurr =q.poll();`
	`18`	`+intnodeVal =curr.val;`
	`19`	`+`
	`20`	`+if((evenLevel &&nodeVal %2 ==0) \|\| (!evenLevel &&nodeVal %2 !=0))`
	`21`	`+returnfalse;`
	`22`	`+if((evenLevel &&nodeVal <=prev) \|\| (!evenLevel &&nodeVal >=prev))`
	`23`	`+returnfalse;`
	`24`	`+`
	`25`	`+prev =nodeVal;`
	`26`	`+`
	`27`	`+if(curr.left !=null)`
	`28`	`+q.add(curr.left);`
	`29`	`+if(curr.right !=null)`
	`30`	`+q.add(curr.right);`
	`31`	`+ }`
	`32`	`+evenLevel = !evenLevel;`
	`33`	`+ }`
	`34`	`+returntrue;`
	`35`	`+ }`
	`36`	`+}`

Comments

(0)