Added solution for - Reverse Odd Levels Of Binary Tree (LC#2415)

[Coder481]

Pull Request Template

Description

Given the root of a perfect binary tree, reverse the node values at each odd level of the tree.
For example, suppose the node values at level 3 are [2,1,3,4,7,11,29,18], then it should become [18,29,11,7,4,3,1,2].
Return the root of the reversed tree.
A binary tree is perfect if all parent nodes have two children and all leaves are on the same level.
The level of a node is the number of edges along the path between it and the root node.

Approach

Store all the level's data in a list by simply any traversal(pre-order here). Then again traverse the tree and when found the odd level, change the root data with the last element of the level-list and remove the last item.

Put check marks:

Have you made changes in README file ?

• Added problem & solution under correct topic.
• Specified Space & Time complexity.
• Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• Test A
• Test B

Make sure all below guidelines are followed else PR will get Reject:

• My code follows the style guidelines of this project
• I have performed a self-review of my own code
• I have commented my code so that it is easy to understand
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• Any dependent changes have been merged and published in downstream modules

[welcome]

I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP!