The Data Structures folder has a missing data structure which is the Binary Trie. This is a useful data structure to manipulate bit-focused information of the list.
Insert-> O(log n)
Delete->O(log n)
Search->O(log n)
An example of it's usefulness is if we want to find the smallest number greater than or equal to x (input) that is absent in the list in O(log n).
shwhite17
commented
4 years ago
This is a(n):
Details:
The Data Structures folder has a missing data structure which is the Binary Trie. This is a useful data structure to manipulate bit-focused information of the list. Insert-> O(log n) Delete->O(log n) Search->O(log n)
An example of it's usefulness is if we want to find the smallest number greater than or equal to x (input) that is absent in the list in O(log n).