Lecture - 6 Trees | Courses.com

Course Lectures

Lecture - 1 Introduction to Data Structures and Algorithms
Prof. Naveen Garg

Play
Lecture - 2 Stacks
Prof. Naveen Garg

Play
Lecture - 3 Queues and Linked Lists
Prof. Naveen Garg

Play
Lecture - 4 Dictionaries
Prof. Naveen Garg

Play
Lecture - 5 Hashing
Prof. Naveen Garg

Play
Lecture - 6 Trees
Prof. Naveen Garg

Playing
Lecture - 7 Tree Walks / Traversals
Prof. Naveen Garg

Play
Lecture - 8 Ordered Dictionaries
Prof. Naveen Garg

Play
Lecture - 9 Deletion
Prof. Naveen Garg

Play
Lecture - 10 Quick Sort
Prof. Naveen Garg

Play
Lecture - 11 AVL Trees
Prof. Naveen Garg

Play
Lecture - 12 AVL Trees
Prof. Naveen Garg

Play
Lecture - 13 Trees
Prof. Naveen Garg

Play
Lecture - 14 Red Black Trees
Prof. Naveen Garg

Play
Lecture - 15 Insertion in Red Black Trees
Prof. Naveen Garg

Play
Lecture - 16 Disk Based Data Structures
Prof. Naveen Garg

Play
Lecture - 17 Case Study: Searching for Patterns
Prof. Naveen Garg

Play
Lecture - 18 Tries
Prof. Naveen Garg

Play
Lecture - 19 Data Compression
Prof. Naveen Garg

Play
Lecture - 20 Priority Queues
Prof. Naveen Garg

Play
Lecture - 21 Binary Heaps
Prof. Naveen Garg

Play
Lecture - 22 Why Sorting
Prof. Naveen Garg

Play
Lecture - 23 More Sorting
Prof. Naveen Garg

Play
Lecture - 24 Graphs
Prof. Naveen Garg

Play
Lecture - 25 Data Structures for Graphs
Prof. Naveen Garg

Play
Lecture - 26 Two Applications of Breadth First Search
Prof. Naveen Garg

Play
Lecture - 27 Depth First Search
Prof. Naveen Garg

Play
Lecture - 28 Applications of DFS
Prof. Naveen Garg

Play
Lecture - 29 DFS in Directed Graphs
Prof. Naveen Garg

Play
Lecture - 30 Applications of DFS in Directed Graphs
Prof. Naveen Garg

Play
Lecture - 31 Minimum Spanning Trees
Prof. Naveen Garg

Play
Lecture - 32 The Union
Prof. Naveen Garg

Play
Lecture - 33 Prims Algorithm for Minimum Spanning Trees
Prof. Naveen Garg

Play
Lecture - 34 Single Source Shortest Paths
Prof. Naveen Garg

Play
Lecture - 35 Correctness of Dijkstras Algorithm
Prof. Naveen Garg

Play
Lecture - 36 Single Source Shortest Paths
Prof. Naveen Garg

Play