Provide an algorithm to reverse a linked list without using recursion.
There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
How do you do binary search?
Why merge sort is better than insertion sort?
What are the standard ways in which a graph can be traversed?
Define linked list data structure.
What is difference between hashtable and hashmap?
Explain what is the bucket size, when the overlapping and collision occur at same time?
What are the applications of b-tree?
Given M x N matrix with sorted elements row wise and column wise, find elements?
What is default size of hashmap?
Is hashtable throw concurrentmodificationexception?
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?