CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Applications of SLL

Which of the ...

Question

Which of the following can be implemented on a linked list?
A) Insertion sort
B) Binary search
C) Radix sort
D) Polynomial function

A

All of the above

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

A & B only

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

A, C & D

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

D

B & C only

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C A, C & D
Implemented on a linked list
1) insertion sort
2) Radix sort
3) Polynomial function.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Which of the following are true with respect to linked list?
I. Each link of node contains a pointer to the next node.
II. Searching an element in singly linked list is sequential.
III. Linked list are best suited for radix sort and binary search where searching on element is dynamic
IV. Each node contains a data part and pointer to the next node where an array of pointer ponts to the links.

Q. What is the time complexity for searching on element in a doubly linked list and insertion of an element in a sorted linked list with n elements?

Q. Given a circular doubly linked list whose content are sorted in ascending order, what is the run time complexity for inserting a new element into the list so that it remains correctly sorted? (Including the time required to search for the elements correct position)

Q. Which of the following sorting algorithms are stable?

I. Insertion sort II. Bubble sort
III. Merge sort IV. Heap sort

Q. Which of the following statement are correct?
I. In a max heap tree, the minimum value will always lie in one of the leaf node.
II. Worst case time complexity of searching on element in a binary search tree is O(n)
III. In an AVL Tree, the smallest element can be found in o(log(n)) time.
IV. DFS requires back tracking which is implemented using stack.

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Applications of SLL

OTHER

Watch in App

explore_more_icon

Explore more

Applications of SLL

Join BYJU'S Learning Program

CrossIcon