1. Which of the following cannot be implemented efficiently in Linear Linked List
1. Quicksort
2. Radix Sort
3. Polynomials
4. Insertion Sort
5. Binary Search
2. In binary search tree , n=nodes, h=height of tree. What's complexity?
1. o(h)
2. o(n*h)
3. o(nLogn)
4. o(n*n)
5. None
Click Here Persistent placement paper 2011
1. Quicksort
2. Radix Sort
3. Polynomials
4. Insertion Sort
5. Binary Search
2. In binary search tree , n=nodes, h=height of tree. What's complexity?
1. o(h)
2. o(n*h)
3. o(nLogn)
4. o(n*n)
5. None
Click Here Persistent placement paper 2011
No comments:
Post a Comment