Learn · Data Structures And Algorithms
Lecture 3 of 36Data Structures And Algorithms
Queues and Linked Lists
Prof. Naveen Garg · IIT Delhi
Credits and licence
- From
- Data Structures And Algorithms, IIT Delhi (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Introduction to Data Structures and Algorithms
- Stacks
- Queues and Linked Lists
- Dictionaries
- Hashing
- Trees
- Tree Walks / Traversals
- Ordered Dictionaries
- Deletion
- Quick Sort
- AVL Trees
- AVL Trees
- Trees
- Red Black Trees
- Insertion in Red Black Trees
- Disk Based Data Structures
- Case Study: Searching for Patterns
- Tries
- Data Compression
- Priority Queues
- Binary Heaps
- Why Sorting
- More Sorting
- Graphs
- Data Structures for Graphs
- Two Applications of Breadth First Search
- Depth First Search
- Applications of DFS
- DFS in Directed Graphs
- Applications of DFS in Directed Graphs
- Minimum Spanning Trees
- The Union
- Prims Algorithm for Minimum Spanning Trees
- Single Source Shortest Paths
- Correctness of Dijkstras Algorithm
- Single Source Shortest Paths