# Java solution to Leetcode 1609

In this Leetcode problem, we need to check the property of a binary tree:

A binary tree is named

Even-Oddif it meets the following conditions:The root of the binary tree is at level index

`0`

, its children are at level index`1`

, their children are at level index`2`

, etc.For every

even-indexedlevel, all nodes at the level haveoddinteger values instrictly increasingorder (from left to right).For every

odd-indexedlevel, all nodes at the level haveeveninteger values instrictly decreasingorder…