What are the different binary tree traversal techniques?
What is the purpose of sorting algorithms?
Describe the merge sort principle and what will be its time complexity?
Write the syntax in c to create a node in the singly linked list.
Give a basic algorithm for searching a binary search tree?
Does treemap allow null key?
Which sorting algorithm uses minimum number of swaps?
What do you know about the big-o notation and can you give some examples with respect to different data structures?
Is vector synchronized?
Differentiate between hashmap and treemap.
What is the difference between list, set and map?
How is hashmap o 1?
How do you solve a selection sort?