Skip to content
#

binary-search-tree

Here are 752 public repositories matching this topic...

Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.

  • Updated Oct 31, 2019
  • C
shaunc
shaunc commented Oct 14, 2018

Thanks for the library. It would be great to document what happens in the case of equal keys (by the comparator function).

I want to store (numerical) ranges, and be able to search for all items whose range is overlapping. (In fact, the items indexed have disjoint ranges, but the search range may have start and end overlapping several.) My idea was to have a comparator that took a range as a ke

Improve this page

Add a description, image, and links to the binary-search-tree topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the binary-search-tree topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.