Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is the difference between a hashmap and hashtable?
Differentiate null and void?
What are the advantages of array?
What are different dynamic memory allocation technique in c.
In what areas do data structures are applied?
What is sorting and classifying?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
What differences exist between hashmap and hashtable?
How to find the duplicate in an array?
What is the complexity of selection sort?
How is a hashset implemented?
What are the Differences between map and hashmap?
Explain what is a spanning tree?
What is declaring array?