Traversal in Binary Tree (InOrder, PostOrder and PreOrder Traversals)
Parenthesis Matching Problem Using Stack Data Structure (Applications of Stack)
Introduction to Data Structures & Algorithms
3.b) Count Nodes in given range in bst || Binary Search Tree
L-3.8: Introduction to Heap Tree with examples | Max Min Heap