top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

On the basis of space complexity, which data structure is better: hash table, linked list, binary search tree or tree?

+1 vote
321 views
On the basis of space complexity, which data structure is better: hash table, linked list, binary search tree or tree?
posted May 11, 2017 by anonymous

Looking for an answer?  Promote on:
Facebook Share Button Twitter Share Button LinkedIn Share Button

Similar Questions
+1 vote
Java: Need a fully functional hash table with time complexity for search O(n)

I need a fully functional hash table with time complexity for search O(n). Can someone please help me?

+2 votes
Invert a binary tree which consists of 0 or 1 in the way, where each node value is a LOGICAL AND between its children?

You have a binary tree which consists of 0 or 1 in the way, that each node value is a LOGICAL AND between its children:

      0
   /    \
  0      1
 / \    / \
0   1  1   1

You need to write a code, which will invert given LEAF and put tree in a correct state.

Note: Received by some user over whatsapp, sharing in exact form?

...