CMC
Company
Programming
Technical
The ideal data structure to handle backtracking is?
A Queue
B Tree
C Stack
D Linked list
Read Solution (Total 1)
B.Tree data structure is used to backtracking
9 years ago
Helpfull: Yes(1) No(0)
CMC Other Question
A vendor bought dog for Rs. 1, and a cat for Rs. 1.20, a pig for Rs.1.34, He totally purchased 100 animals for 100 Rs. Then find no of each animal.
Which of the following sorting algorithms does not have worst case running time of O(n2) ?
A Merge Sort
B Quick Sort
C Bubble Sort
D Insertion Sort