B+ Tree is a N-ary tree often used in database indexing that supports large number of children per node. @joeleba @thamzhengyi 😆

See also: https://en.wikipedia.org/wiki/B%2B_tree

https://docs.python.org/2/library/collections.html#collections.Counter

I see you are using Array.prototype.unshift and Array.prototype.shift as methods in the double-ended queue DS.

I believe these methods have O(n) time complexity, shouldn't the queue's operations all be O(1) time complexity?

Ought to have. and also all the nice open source badges.

http://www.geeksforgeeks.org/heap-sort/

A graph can have a value, and zero, one or more neighbours.

• Search for target
• Bisect left
• Bisect right

References:

• https://docs.python.org/2/library/bisect.html

• Heap class:
  • constructor()
  • size
  • isEmpty()
  • peek() // max or min depending on type of heap
  • insert()
  • extract()
  • static heapify<T>(arr: T[])
• should cover min heap
• should cover max heap

References

• https://docs.python.org/3.7/library/heapq.html
• https://medium.com/basecs/heapify-all-the-things-with-heap-sort-55ee1c93af82

The following classes should support the following operations:

BinaryTree class:

• constructor()
• getRoot()
• height()
• size()
• isBalanced()
• isComplete()
• preOrder()
• inOrder()
• postOrder()

BinarySearchTree class which extends from BinaryTree:

• insert()
• search()
• delete()
• getMinimum()
• getMaximum()

In order to implement the other tree data structures, we need another node class that allows just to represent it's left-subtree and right-subtree. Preferably, this node will also take into account certain properties, such as length: number of nodes in its subtree.

• BinaryTreeNode class:
  • constructor()
  • val
  • left
  • right
  • isLeaf()

• AVLTree class which extends from BinarySearchTree:
  • insert()
  • search()
  • delete()

• initialize(n)
• findSet(x)
• isSameSet(x, y)
• unionSet(x, y)

@yangshun how could we have missed this DS out for so long. @stevenhalim XD

Hey, I want to participate in this porject, is there anything i can do for it?

https://sagi.io/2017/07/bloom-filters-for-the-perplexed/

https://llimllib.github.io/bloomfilter-tutorial/

Currently most of the data structures accept number values and uses > or < (or variant) for comparison. As this is intended to be a library, we should incorporate IoC as much as possible.

A few ways we can do this include:

• adding generic parameters to determine what are the values that the data structure should accept
• accepting comparators to compare the values

I will assess and determine which data structures / algos can be done.