Algorithms and data structures
Trees and heaps
Binary search trees, keeping them balanced, and priority queues.
About 15 hours of study.
Where to learn it
Read
Watch
Introduction to Algorithms (MIT 6.006, Spring 2020)
Erik Demaine, Jason Ku, Justin Solomon
Lectures 6–8
Section not checked yet
Practise
No practice set picked yet.
Suggest oneOther options
- Data Structures and Algorithms (NPTEL) (watch)
Lectures on trees, AVL trees and heaps
Which roles ask for it
- Software engineer (SDE) to get hired
- Backend engineer to get hired
- GATE computer science to get hired