I believe so. For example, Each node of a binary tree would use 4 array cells: one for a pointer to the father node, two pointers to the two sons, and one for the value. Each element of a hash table would use 4 or 5 array cells: the index, possibly a random key that efficiently encode the index, the value, a pointer to the previous index, and a pointer to the next index. This would make finding,…
Most Popular Content on DSC
To not miss this type of content in the future, subscribe to our newsletter.
Other popular resources
Most popular articles