My name is Howard, I'm a software engineer like Omin, and I can't balance a binary search tree either.https://twitter.com/jedisct1/status/836880473565573121 …
Easiest way: build a BST using H(k). You can’t do in-order traversal and it’s not perfectly balanced, but it may be acceptable.
-
-
I have a compsci MSc from Oxford and this is still barely comprehensible to me.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.