Define a priority queue?
What are splay trees?
Define parent node?
How to get the index of an array element?
What is hashing technique?
Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topological order and then apploy the fact that every vertex must come before its successors in the topolgical order.
What is bubble sort used for?
How many null values are allowed in hashmap?
Is treemap thread safe?
What is placement new in data structures?
How do you find the depth of a binary tree?
Can hashtable have duplicate values?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.