# Data Structures Final Exam

**SuperClass**

You are using a language that does not support recursion. What data structure would you use to traverse a binary search tree in order? Queue List Stack Can’t traverse a tree in order without recursion The data structure that keeps track of activation records during the execution of a program Run-time queue Run-time stack Linked list Heap Which of the following statements could describe the base case of a recursive algorithm? F(x) = x – F(x – 1) If the array length is 100, do nothing All parameters are integers F(0) = 27 B and D above Int Func(/*in*/int n) { If (n == 5) Return 5; Else Return 2 * Func (n+1); } What is the value of the expression Func (2)? The three-question testing method is based on what computing technique? Top-down design Object-oriented design Induction Divide/conquer Answer not shown Draw the binary search tree containing the following 11 values in the order shown and answer the question. 15 7 9 21 44 30 33 29 10 1 17 ( in that order). What level is the value of 17 ( root is level 0)? 0 1 2 3 4 Draw the binary search tree containing the following 11 values in the order shown and answer the question. 15 7 9 21 44 30 33 29 10 1 17 ( in that order). Which is the inorder successor of 15? 10 9 17 7 44 Draw the binary search tree containing the following 11 values in the order shown and answer the question. 15 7 9 21 44 30 33 29 10 1 17 ( in that order). How many levels are in the tree? 3 4 5 6 Unknown Draw the binary search tree containing the following 11 values in the order shown and answer the question. 15 7 9 21 44 30 33 29 10 1 17 ( in that order). Which is the inorder predecessor of 44? 29 30 21 33 Unknown Draw the binary search tree containing the following 11 values in the order shown and answer the question. 15 7 9 21 44 30 33 29 10 1 17 ( in that order). How many nodes are there on level 2 (root is level 0)? 2 3 4 5 Unknown The value property of heaps says that the...

- 6 years ago

**Data Structures Final Exam A+ Tutorial use as Guide**

Purchase the answer to view it

- data_structures_final_exam.docx