Implement Queue Using Stacks
- Implement Queue Using Stacks
- Find the Kth Smallest/Largest Element in an Array
- Priority Queue Implementation
- In a Binary Tree, Create Linked Lists of all the nodes at each depth.
- Breadth-First Search/Traversal in a Binary Tree
- Find the Height of a tree without Recursion
- Search the Element in a binary tree — With and Without Recursion
- Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern
- Find the Size of the Binary Tree
- Level Order Traversal, Print each level in separate line.