a binary tree name EvenOdd meet follow conditionsThe root binary tree level index 0 child level index 1 child level index 2 etcfor evenindexe level node level odd integer value strictly increase order leave rightfor oddindexed level node level integer value strictly decrease order leave rightGiven root binary tree return true binary tree EvenOdd return false Example 1input root 11043null791286nullnull2output trueExplanation the node value level arelevel 0 1level 1 104level 2 379level 3 12862since level 0 2 odd increase level 1 3 decrease tree evenoddexample 2input root 542337output falseexplanation the node value level arelevel 0 5level 1 42level 2 337node value level 2 strictly increase order tree evenoddexample 3input root 591357output falseexplanation Node value level 1 integer ConstraintsThe number nod tree range 1 1051 Nodeval 106