My studies at the university was about Pre-order, Post-order, in-order traversal, red-and-black trees, AVL-trees. This included the proofs of correctness, Big-O analysis of the data-structures, and multiple implementations (recursive vs iterative), and practical issues (ex: using a profiler, unit tests, source control, object-oriented programming, and roughly 4 different implementations for Scheme, Ruby, Haskell and Java).
I'm proud of my university education, but it decidedly did NOT cover the method discussed in this blog post. (Nor other popular subjects, such as Robin Hood hashing. My professor did cover skip lists and cuckoo hashing however)
There's so much to learn about trees out there, that I doubt any university class can really cover them all (even with 3-months per semester and maybe 3 or 4 different classes discussing the subject).
Even IF you did go to a university, there's no guarantee you've learned everything. And even if you were taught it at a university, there's no guarantee you'd actually remember it all. I'm sure I've forgotten plenty of things from my classes (or in the case of "Dynamic programming", I never really learned it the first time around...)
I'm proud of my university education, but it decidedly did NOT cover the method discussed in this blog post. (Nor other popular subjects, such as Robin Hood hashing. My professor did cover skip lists and cuckoo hashing however)
There's so much to learn about trees out there, that I doubt any university class can really cover them all (even with 3-months per semester and maybe 3 or 4 different classes discussing the subject).
Even IF you did go to a university, there's no guarantee you've learned everything. And even if you were taught it at a university, there's no guarantee you'd actually remember it all. I'm sure I've forgotten plenty of things from my classes (or in the case of "Dynamic programming", I never really learned it the first time around...)