Binary search trees and a pathological insertion order
Build the same binary-search-tree keys in two insertion orders, compare path lengths, and identify when an unbalanced tree loses logarithmic lookup.
Foundation
The journal / Ideas in progress
Engineering & everyday learningNotes from
the work.
Software, systems, and the things I’m learning along the way. From first principles to AI in production.
Find something to readAll notes 1
A little theory. A lot of practice.