1:00:15
Introduction To Trees | Binary Tree in Data Structure
1:24:59
Binary Tree in Data Structure | Binary Tree Traversal | How to Create Binary Tree | DSA
1:44:38
Binary Tree Problems For Technical Interview | Size of Binary Tree | Height of Binary Tree
1:45:07
Binary Tree Problems: Mirror Tree | Two Nodes are Cousins | Check for Balanced Tree | Spiral Form
1:36:45
Binary Tree: Left View of Binary Tree | Right View of Binary Tree | Top View of Binary Tree
47:09
Binary Tree: PreOrder Traversal Iterative | PostOrder Traversal Iterative | InOrder Traversal
1:12:35
Binary Tree Problems: Construct Tree from Inorder & Preorder | Tree from Postorder and Inorder
1:26:41
Binary Tree Traversal: Vertical Traversal of Binary Tree | Diagonal Traversal | Boundary Traversal
1:00:26
Morris Traversal : Inorder Traversal | Flatten Binary Tree to LinkedList | Post Order | PreOrder
1:27:12
Burning Tree || Maximum Path Sum between 2 Special Nodes
1:28:26
Binary Search Tree in Data Structure || Implementation, Insertion , Deletion and Search
1:25:18
Binary Search Tree Interview Problem | 5 Binary Search Tree Problems in One Shot
1:28:53
Binary Search Tree Problems for Coding Round
1:03:06
Binary Search Tree: LCA of BST | Find Common Nodes in 2 BST | Check whether BST contains Dead End
1:30:21
Binary Search Tree: Fixing Two nodes of a BST | Sorted Link List to BST | Merge two BST
1:19:24
Largest Binary Search Tree | Maximum Sum BST in Binary Tree | Leetcode
1:38:20
AVL Tree in Data Structure | AVL Tree Insertion | AVL Tree Search | AVL Tree Rotation
54:58
AVL Tree Deletion | (Theory + Dry Run + Code Implementation)
1:15:24
Heap Data Structure | Insertion and Deletion in Max Heap
1:19:47
Heap Sort | Build Heap in C++ | Priority Queue
1:22:08
Heap 6 Interview Problem | Height of Heap | Minimum Cost of ropes | Magician and Chocolates
1:08:18
Kth smallest element in an array | Kth Largest element in an array | Heap | Priority Queue
55:15
Merge two binary Max heaps | Is Binary Tree Heap | BST to max heap
1:18:58
Heap Hard Problem: Kth element in Matrix (5 Approaches) | Find median in a stream
1:28:49
Heap Interview Problem: Merge K Sorted Linked List | Merge K Sorted Arrays
1:30:28
Heap: Smallest Range Covering Elements from K Lists | Construct Target Array With Multiple Sums