@virenj2288
Nothing here yet.
Nothing here yet.
Jun 23, 2025 · 6 min read · By Virendra Jadhav When working with binary trees, it’s common to face problems where you need to reconstruct the tree from given traversal orders. In this blog, we’ll cover: ✅ How to build a binary tree from Preorder and Inorder Traversals ✅ How t...
Join discussionJun 12, 2025 · 4 min read · 📚 Problem Overview In Vertical Order Traversal of a Binary Tree, we need to: Print nodes column-wise from left to right. Sort nodes in each column top to bottom. If two nodes share the same position, sort their values in ascending order. 💡 Th...
Join discussion
Jun 10, 2025 · 4 min read · Hey everyone! 👋In this blog, we will explore the Zigzag Level Order Traversal of a binary tree – a very common interview question that challenges your understanding of Breadth-First Search (BFS) and how to modify it for custom traversal patterns. Le...
Join discussionJun 9, 2025 · 5 min read · 🚀 Introduction Binary Trees are one of the most fascinating and frequently asked data structures in technical interviews. Among them, LeetCode Problem 124: Binary Tree Maximum Path Sum is a beautiful combination of recursion, tree traversal, and opt...
Join discussion