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
Practise
Top Interview 150
LeetCode
Top Interview 150: Binary Tree General, Binary Tree BFS, Binary Search Tree, Heap
Grouped by topic, which makes it a good map of interview DSA. Needs a free account.
Other options
- Data Structures and Algorithms (NPTEL) (watch)
Lectures on trees, AVL trees and heaps
Wrong chapter, dead link, or know something better? Tell us on GitHub.
Which roles ask for it
- Software engineer (SDE) to get hired
- Backend engineer to get hired
- Quant developer to get hired
- GATE computer science to get hired
- GATE data science and AI to get hired
- UGC NET computer science to get hired