binary search trees in ruby

Question

Is there a reason why I don't see binary search trees used much in Ruby?

Is there an equivalent data structure or class that people typically use instead?

I'm not trying to solve a specific problem; just trying to learn more about the language.

thanks!

Mark Reed · Accepted Answer · 2012-03-28 03:32:22Z

6

Binary search trees are a relatively low-level implementation detail, usually for a map/table abstract data type. In Ruby, if you want a map/table, you just use a Hash. If you have a problem that specifically needs binary search trees, there's also a good chance a Ruby implementation will be too slow to be useful.

answered Mar 28, 2012 at 3:32

Mark Reed

96k17 gold badges149 silver badges189 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

binary search trees in ruby

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related