What are the advantage of collection classes over arrays?
What do you mean by data types?
Why heap sort is not used?
How do you find the size of an arraylist?
What are the 3 types of measurement?
Why do we use hashset?
Explain binary tree traversals?
Can you sort a string?
What is difference between set and map?
How do you do binary search?
What is minimum depth of binary tree?
Why might quick sort might be better than merge sort?
why boundary tag representation is used?