Given an unsorted linked list, and without using a temporary buffer, write a method that will delete any duplicates from the linked list?
What do you mean by 2-3 tree?
Explain the term run-time stack?
In Data Structure, write output of given program.
What is the difference between data type and data structure?
What is meant by balanced binary tree?
Is binary tree a bst?
How do you use merge sort?
How do you do binary search?
What is difference between stack and queue?
What is list and types of list?
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 ].
Why hashtable is faster than arraylist?
What is circular queue example?
what is the difference between Linear Array and Linked List?