Comparison Mode

Side-by-side: use case, requirements, complexity, strengths, weaknesses, example problems, and a clear “choose this when…”.

BFS vs DFSDijkstra vs Bellman-FordKruskal vs PrimMerge Sort vs Quick SortHeap vs Priority QueueHash Map vs Tree MapBFS vs DijkstraSliding Window vs Two PointersPrefix Sum vs Segment TreeGreedy vs Dynamic ProgrammingMemoization vs TabulationTarjan vs KosarajuSegment Tree vs Fenwick TreeArray vs Linked ListStack vs QueueQuick Sort vs Heap SortKMP vs Rabin-KarpUnion-Find vs DFSTrie vs Hash MapAVL Tree vs Red-Black Tree
AVL TreeTrees
Red-Black TreeTrees
Use caseOrdered maps with far more lookups than insertions/deletions.General-purpose ordered maps/sets in standard libraries (C++ std::map, Java TreeMap).
RequirementsHeight (or balance factor) stored per node; rotations after every insert/delete.One color bit per node; rotations and recolorings.
Time complexitySearch, insert, delete O(log n); height at most ~1.44 log2 n.Search, insert, delete O(log n); height at most 2 log2(n + 1).
Space complexityO(n) plus an integer per node.O(n) plus one bit per node.
StrengthsStricter balance gives the shortest trees and fastest searches.At most 2 rotations per insert and 3 per delete; cheaper writes; well-understood library implementation.
WeaknessesMore rotations on insert and especially delete; delete may rotate O(log n) times.Slightly taller trees, so lookups are marginally slower than AVL.
Example problemsKth smallest in BST (with subtree sizes), order-statistic trees, read-heavy indexes.My calendar, count of range sums, any sorted-map problem via the language library.
Choose this whenChoose AVL when the workload is read-heavy and every lookup should touch as few nodes as possible.Choose red-black when writes are frequent or you simply want the standard-library ordered map; in interviews, name it and use the library.