Inorder, preorder and postorder traversals can be accomplished using no pointers
ID: 3583147 • Letter: I
Question
Inorder, preorder and postorder traversals can be accomplished using no pointers. recursion no parameters no arguments None of the above. The advantage of a linear search is that it is simple. It is efficient. It is fast. It can be used on unordered data. Both A and D The sort usually performs fewer exchanges than the sort. binary. linear linear, binary selection, bubble bubble, selection linear, bubble If a bubble sort is used to arrange the number 7 5 3 9 2 6 in ascending order, what order will the data be in .liter the first pass? 2 5 3 9 7 6 5 3 7 2 6 9 235 6 7 9 5 7 3 9 2 6 none of the above If a binary search is used to search for the number 4 in the 11-element array shown below, which value will the 4 be compared to first? 1 2 3 4 6 7 8 9 10 12 17 1 7 8 9 17 If a hash function computes the same value for multiple keys, we say there is a contact collision attack invalid operation None of the above We say that a structure is a heap if each parent is greater than the child each parent is greater than the left child but smaller than the right child All leaf nodes are on the left A and C B and CExplanation / Answer
7) inorder preorder postorder traversal can be accomplished using recursion (B)
8) the advantage of linear search (E) both (A) and (D)
9) selection sort uses fewer exchanges than bubble (C)
10) (B) 5 3 7 2 6 9