›What is a data structure and what is an abstract data type (ADT)?Junior#Data Structures#ComplexityDetails →
›What is an array and what are the complexities of its operations?Junior#Data Structures#ComplexityDetails →
›What are the trade-offs between an array and a linked list?Junior#Data Structures#ComplexityDetails →
›What is an abstract data type (ADT) and why separate it from its implementation?Junior#Data StructuresDetails →
›What is a binary tree and what are the common traversal orders?Middle#Trees#Data StructuresDetails →
›What is a binary search tree (BST) and what are its operation complexities?Middle#Trees#ComplexityDetails →
›What are balanced BSTs (AVL and red-black trees) and why do they matter?Middle#Trees#ComplexityDetails →
›What is amortized analysis, using dynamic array resizing as an example?Middle#Complexity#Data StructuresDetails →
›What are weighted and directed graphs, and what problems do they model?Senior#Graphs#ComplexityDetails →
›What is a disjoint-set (union-find) structure with path compression and union by rank?Senior#Graphs#ComplexityDetails →
›What is a skip list and how does it achieve O(log n) search?Senior#Data Structures#ComplexityDetails →
›How do segment trees and Fenwick trees (BIT) support fast range queries?Senior#Trees#ComplexityDetails →
›How do you design a data structure with specific O(1)/O(log n) requirements?Senior#Data Structures#ComplexityDetails →
