Data Structures And Algorithms

A lecture-by-lecture course

Taught by Prof. Naveen Garg of IIT Delhi, this 36-lecture series builds from the basics of data structures through to balanced search trees. The lecture list moves in a deliberate order, starting with stacks and queues and ending with insertion into red-black trees.

Highlights

• Dictionaries, hashing and ordered dictionaries, the building blocks behind many lookups.
• Tree walks, deletion and the AVL and red-black tree material for balanced search.
• Quick sort, included alongside the tree and dictionary topics.

Who it suits

Students who prefer a traditional lecture series with academic depth on balanced trees and dictionaries. Watching the lectures in order makes the progression from simple structures to balanced trees easier to follow.