Leetcode 2415 Reverse Odd Levels of Binary Tree

If you find this video helpful, please 'Like' & 'Subscribe'.
This is really helpful for the channel and also motivates me to do more of such good videos.


Leetcode 2415 Reverse Odd Levels of Binary Tree

Problem 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.

Problem Link :
https://leetcode.com/problems/reverse...

Youtube channel:    / @maksrane100  

https://github.com/maksrane100/leetco...

#coding #softwareengineer #Leetcode #Algorithm #DataStructure #Java #programmer #tech #software #codinglife #Preparation
#interview #programminglife #programmingisfun #leetcode #leetcode2368 #codeforces #algorithm #algorithms #datastructure #datastructuresandalgorithms #programming #computerscience #bfs #breadthfirstsearch
#interviewpreparation #codingquestions #codinginterviewquestions