Daily Leetcode Challenge | DEC 20 | Reverse Odd Levels of Binary Tree

[@darshankumar5546]

from collections import defaultdict class Solution: def reverseOddLevels(self, root: Optional[TreeNode]) -> Optional[TreeNode]: levelEle=defaultdict(list) def dfs(root,level=0): if(root==None): return if(level%2==1): levelEle[level].append(root.val) dfs(root.left,level+1) dfs(root.right,level+1) dfs(root) #print(levelEle) def dfs2(root,level=0): if(root==None): return if(level%2==1): root.val=levelEle[level].pop() dfs2(root.left,level+1) dfs2(root.right,level+1) dfs2(root) return root

[@darshankumar5546]

Hindi Explanation: kzbin.info/www/bejne/d3K8q3yjfN-aa8U