No Duct-tape code

Which data structure would you prefer when you need to keep track of the maximal element of a set being updated frequently?

Linked List Hash Table AVL Tree Heap Array Binary Search Tree

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...