Umer Naeem·Oct 9Understanding Binary Tree TraversalsBinary tree traversals have a reputation for being one of the hardest topics in coding interviews. For a long time, I had them crammed…
Rucha Sinkar·Jun 26DFS — Preorder, Inorder, PostorderTree DFS is structured — one root, no cycles, clear left/right. Graph DFS is messier — arbitrary connections, cycles, disconnected…
Maniharan chary Katukojwala·Mar 3From Confusion to Clarity: Tree Traversals Explained.1.Pre-Order Traversal.
Abhishek Pathak·Nov 14, 2025Data Structure series: Binary TreeData structures are the backbone of computer programming, and trees are among the most fundamental structures used for organizing…
IndeluxifybyKunal Sinha·Sep 21, 2025Leetcode 113. Path Sum IIGiven the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals…
IndeluxifybyKunal Sinha·Sep 20, 2025Leetcode#112: Path SumGiven the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the…
InStackademicbyM. Ali Khan·Sep 16, 2025Morris Pre-Order Traversal: The Space-Saving Trick for Binary TreesTree traversals are at the heart of many algorithms in computer science. The standard recursive or stack-based methods for pre-order…
Priyanshi·Sep 6, 2025LeetCode 94: Binary Tree Inorder TraversalRecursion and Morris Inorder Traversal
IndeluxifybyKunal Sinha·Sep 4, 2025Binary Tree Sum of each levelGiven the root of a binary tree, return the sum of the nodes at each level. The output should be a list containing the sum of the nodes at…
![Level Order Traversal [DSA — Tree Problem]](https://miro.medium.com/v2/resize:fill:160:106/1*X49dpiEdbKxz7Hv9wnlwmQ.jpeg)
![Level Order Traversal [DSA — Tree Problem]](https://miro.medium.com/v2/resize:fill:320:214/1*X49dpiEdbKxz7Hv9wnlwmQ.jpeg)