1609. Even Odd Tree
https://leetcode.com/problems/even-odd-tree
Description
A binary tree is named Even-Odd if it meets the following conditions:
The root of the binary tree is at level index
0
, its children are at level index1
, their children are at level index2
, etc.For every even-indexed level, all nodes at the level have odd integer values in strictly increasing order (from left to right).
For every odd-indexed level, all nodes at the level have even integer values in strictly decreasing order (from left to right).
Given the root
of a binary tree, return true
if the binary tree is Even-Odd, otherwise return false
.
Example 1:
Example 2:
Example 3:
Example 4:
Example 5:
Constraints:
The number of nodes in the tree is in the range
[1, 105]
.1 <= Node.val <= 106
ac
Previous1608. Special Array With X Elements Greater Than or Equal XNext1610. Maximum Number of Visible Points
Last updated