7 тысяч подписчиков
97 видео
Boundary Traversal of Binary Tree | Trees
Preorder Traversal of Binary Tree without Recursion | Iterative Preorder Traversal of Binary Tree
Palindrome Linked List | Check if Linked List is Palindrome
Swap Nodes In Pairs | Recursive and Iterative
Introduction To Sorting | Sorting Algorithms
Intersection of Two Linked Lists
Vertical Order Traversal of a Binary Tree | O(n) method | Trees
Insert in Sorted Circular Linked List
Introduction to Trees | Trees Tutorial | Data Structure
Merge Two Sorted Linked Lists
Reverse Sublist of Linked List | Reverse Linked List II
Serialize and Deserialize Binary Tree | 3 Methods
Graph representation III - Incidence Matrix, Incidence List Explained
Quick Sort | Sorting Algorithm
Graph representation I - Adjacency Matrix Explained | Data Structure
Next Greater Node In Linked List
Diagonal Traversal of a Binary Tree | O(n) method | Trees
Copy/Clone Linked List with Random Pointer | 2 Methods
Odd Even Linked List | Arrange Even Index After Odd Index
Sorted List To Balanced Binary Search Tree | Sorted Linked List To BST
XOR Linked List | Memory Efficient Doubly Linked List
Add Two Numbers Represented by Linked Lists - II
Skip List | Efficient Search in Sorted Linked List
Flatten a Multilevel Doubly Linked List | Using Stack
Flatten a Multilevel Doubly Linked List | Using Recursion
Add Two Numbers Represented by Linked Lists | Reverse Number
Counting Sort | Sorting Algorithm
Inroduction To Trie
Rotate Linked List | Clockwise rotation of Linked List
Convert Sorted Array To Balanced Binary Search Tree | Sorted Array to BST
Height (Maximum Depth) of a Binary Tree | Iterative Method | Trees
Dinic algorithm | Maximum Flow Problem | Network Flow | Graphs | Data Structure
DFS Depth First Search | Graph Traversal | Data Structure
Reverse Nodes in K-Group | Reverse Linked List in groups of given size
BFS Breadth First Search | Graph Traversal | Data Structure
Insertion Sort | Sorting Algorithm
Topological Sort | Kahn vs DFS | Graphs | Data Structure
Merge K Sorted Linked Lists | 4 Methods
2-sum BST | Find a pair with given sum in a BST | 2 Methods
Valid BST from Preorder | Verify Preorder Sequence in Binary Search Tree
Middle of the Linked List | 3 Methods
Start Node of Cycle In Linked List | Proof of Floyd Cycle Detection Algorithm
Graphs Questions | Graphs Practice Problems | How to choose the Graph algorithm
Partition Linked List
Bubble Sort | Sorting Algorithm
Check if Binary Tree is Binary Search Tree | Validate BST
Merge Sort | Sorting Algorithm
Flatten Binary Tree to Linked List | 3 Methods Explained | Trees
Reverse A Linked List | 3 Methods
Construct Full Binary Tree From Preorder and Postorder traversal | Trees
