binary search tree
Give this one a try later!
All left nodes and all of its descendants have smaller values than the root
node, while all right nodes and all of its descendants have larger values
than the root node.
, merge sort
Give this one a try later!
O(n log n) worst case
divide and conquer
hash table open addressing collision handling
Give this one a try later!
all elements are stored in the hash table itself.
hash the key and if the index is taken, insert at next available space
at any point, size of the table must be greater than or equal to the total
number of keys
Number of decision tree comparisons in worst case
Give this one a try later!
Equal to the height of the decision tree
Height of decision tree
Give this one a try later!
Give this one a try later!
All left nodes and all of its descendants have smaller values than the root
node, while all right nodes and all of its descendants have larger values
than the root node.
, merge sort
Give this one a try later!
O(n log n) worst case
divide and conquer
hash table open addressing collision handling
Give this one a try later!
all elements are stored in the hash table itself.
hash the key and if the index is taken, insert at next available space
at any point, size of the table must be greater than or equal to the total
number of keys
Number of decision tree comparisons in worst case
Give this one a try later!
Equal to the height of the decision tree
Height of decision tree
Give this one a try later!
