1.7) Binary Tree Zig-Zag traversal (Spiral Form Traversal)
Spiral form traversal of a Binary Tree involves traversing the nodes level by level, alternating the direction between left to right and right to left. This creates a "zigzag" pattern…
Binary Tree
1.6) Level Order traversal of a Binary Tree
Level Order traversal explores nodes level by level, visiting all nodes at a given level before moving to the next level. This traversal order is useful for tasks like breadth-first…
1.5) Post-Order traversal of a Binary Tree
Post-Order traversal visits nodes of a Binary Tree in the order: Left-Right-Root. This means you start by visiting the left child, then the right child, and finally the current node…
1.4) Pre-Order Traversal of Binary Tree
Pre-Order traversal visits nodes of a Binary Tree in the order: Root-Left-Right. This means you start by visiting the root, then move to the left child, and finally to the…
1.3) In-Order traversal of Binary Tree
In-Order traversal is a way of visiting all nodes of a Binary Tree following a specific order: Left-Root-Right. This means you start from the left child, then visit the root,…
1.2) Binary Tree
A Binary Tree is a type of data structure where each node can have at most two children. It's like a branching structure where each node has the potential to…
2.6) Average of Levels in Binary Tree
Given the root of a binary tree, return the average value of the nodes on each level of the tree.
3.3) N-ary Tree Level Order Traversal
Given the root of an N-ary tree, return the level order traversal of its nodes' values. Level order traversal means visiting all nodes at each level from left to right…
3.2) Minimum Depth of Binary Tree
Given a binary tree, find the minimum depth of the tree. The minimum depth is defined as the minimum distance from the root node to the nearest leaf node. A…
2.9) Find All The Lonely Nodes
Given the root of a binary tree, a lonely node is a node that has no siblings (i.e., it's the only child of its parent). Return an array containing the…