![]() What is the number of nodes in that tree? (a) 1 (b) 4 (c) 5 (d) 14 (e) none of these answersġ A binary tree has n null references stored in it. (a) always (b) never (c) some cases (d) most cases (e) none of these answersġ How many distinct complete binary search trees can be built with four numbers 10, 20, 30, and 40? ![]() (a) 1 (b) 3 (c) 5 (d) 6 (e) none of these answersġ Can a complete binary search tree (binary search tree that is also a complete binary tree) also be (a) 2 (b) 3 (c) 4 (d) 5 (e) none of these answersġ How many distinct binary search trees can be built with three numbers 51, 23, and 45? (a) More than one data value can be stored in each node.ġ What is the depth of the shortest binary tree that contains 11 nodes? (e) none of these answers 1 Which of the following is a common property among B-Trees, 2-3-4 trees, and full binary trees of n (c) The depth of the tree is log 2 (n+1) – 1. (a) Each node can be colored as red or black. Kiyosaki)ĬSE214 COMPUTER SCIENCE II SAMPLE MIDTERM EXAM II 1 Which of the following is a common property among all balanced binary search trees of n nodes? Give Me Liberty!: an American History (Eric Foner). ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |