Question 1 Towers of Hanoi problem is better solved using recursive-based technique Not yet answered Select one: Marked out of 2.00 O A. true p Flag question O B. false Question 2 Which of the following statement is true? i) Using singly-linked lists and circular list, it is not efficient to traverse the list backwards. ii) To find the predecessor, it is required to traverse

the list from the first node in case of Not yet answered Marked out of 1.00 singly linked list. P Flag question Select one: O A. i-only O B. ii-only OC. Both i and ii O D. None of both Hide sidebars

dashboard All leaves in a full binary tree (perfect) are on the same level. Question 27 Not yet answered Marked out of 2.00 p Flag question Select one: O True False Question 28 Not yet answered in a decision binary tree, the internal nodes filled with decisions and the leaves filled with yeso questions Marked out of 2.00 Flag question Select one True False