🚀 Day 39/45 #SDESheetChallenge
• Children Sum Property in Binary Tree
• Check for symmetrical BTs (Recursive)
• Symmetric Binary Tree (Iterative)
• Flatten Binary Tree to Linked List
@takeUforward_
🚀 Day 38/45 #SDESheetChallenge Done
• Maximum path sum
• Construct a BT from Preorder and Inorder
• Construct a BT from Postorder and Inorder
@takeUforward_
🚀 Day 37/45 #SDESheetChallenge Done
• LCA in BT
• Check if two trees are identical or not
• Zig Zag or Spiral Traversal
• Boundary Traversal
@takeUforward_
🚀 Day 36/45 #SDESheetChallenge Done 😉
• Level Order Traversal
• Maximum Depth in BT
• Diameter of Binary Tree
• Check for balanced binary tree
@takeUforward_
🚀 Day 35/45 #SDESheetChallenge Done
• Pre, Post, Inorder in one traversal
• Vertical Order Traversal
• Print root to leaf path in BT
• Maximum Width of BT
@takeUforward_
Done with Day 24 of #SDESheetChallenge
1. Implement Stack using Arrays
2. Implement Queue using Arrays
3. Implement Stack using Queue (using single queue)
4. Implement Queue using Stack
@striver_79@takeUforward_