Skip to main content

Timeline for Recursive binary search tree

Current License: CC BY-SA 3.0

9 events
when toggle format what by license comment
Jan 8, 2015 at 2:29 comment added Thomas @RubberDuck Nice strawman. I'm not even going to bother replying to it as I see you actually have nothing useful/constructive to say.
Jan 8, 2015 at 2:25 comment added RubberDuck @Thomas press Ctrl + F and search for "k". How many false positives do you get?
Jan 7, 2015 at 17:18 comment added Thomas If a programmer can't instantly recognize what the K and V types represent in a key-value datastructure then he should probably put down the keyboard and go to sleep because he's obviously had a bit too much to drink. Being explicit is one thing, being overdescriptive to the point of complete and utter redundancy is quite another.
Jan 7, 2015 at 16:25 comment added RubberDuck It was just an example to illustrate a point @Alnitak
Jan 7, 2015 at 16:24 comment added Alnitak @RubberDuck but he doesn't have Node.K, he has Node.key, with K as a very conventional template identifier for the type of it.
Jan 7, 2015 at 16:18 comment added Emily L. @morbidCode Assumption is the mother of all fk-ups. BST can match many things: BST
Jan 7, 2015 at 16:13 comment added RubberDuck @morbidCode imagine it's not your code for a moment. What would you think of Node.K or Node.V?? Do those names tell you anything at all about what they are or do?
Jan 7, 2015 at 16:11 comment added lightning_missile Um, I thought everyone knows what Bst means, just like Ptr for pointers. I'll make better names next time :)
Jan 7, 2015 at 16:03 history answered RubberDuck CC BY-SA 3.0