Tree
2415. Reverse Odd Levels of Binary Tree
Given a perfect binary tree, reverse the values at odd levels (root is level 0): each odd level's node values are mirror-swapped, while the tree structure is preserved. This is a level-order…
Loading…
Given a perfect binary tree, reverse the values at odd levels (root is level 0): each odd level's node values are mirror-swapped, while the tree structure is preserved. This is a level-order…
Loading…