Treap Explained Time And Space Complexity Ai Engineer Coding Interview

Summary

The AVL tree, from first principles. Sorted keys turn a binary search tree into a chain, so we keep a height on every node and ... The red-black tree, from first principles. Sorted keys turn a binary search tree into a chain, and the AVL tree fixed it with a height on ... The splay tree, from first principles. Sorted keys turn a binary search tree into a chain; AVL fixed it with heights, red-black with ... The Fenwick tree (binary indexed tree), from first principles. A running total of prefix sums answers any query instantly, but ... The interval tree, from first principles. A booking app holds meetings, each with a start and an end, and someone asks which ... The segment tree, from first principles. A shop logs a price every day and someone asks for the lowest price between two days, ... The lazy segment tree, from first principles. A shop raises every price from day 2 to day 6 by ten and then asks for the lowest price ... The persistent segment tree, from first principles. A shop changes one price every day and keeps no history, then someone asks ... The binary search tree, from first principles. A librarian must find one book among a million: shelve them so every node sends a ... Timsort, from first principles. A library shelf that is mostly in order, and why you would never re-sort it from scratch. We see why ... A star pathfinding, from first principles. A robot must cross a warehouse with a shelf in the way: given a grid with walls, a start and ... Morris traversal, from first principles. To list a binary tree in sorted order you normally remember the way back, and that memory is ... Stack and queue, from first principles. A calculator with no brackets, and a spike of sticky notes. We see why rewriting and ... Square root decomposition, from first principles. Given an array and many questions asking for the sum of a range, adding the ...