2. What is the minimum number of entries we can add to the below B+ tree which will cause the height to increase? 4 5 сл 5 14 27 14 17 27 32 32

please do

13 46 65 58 84 94 98 Node 84 is to be removed from the above BST Tree. The first step is to find the rightmost node of 84. How will you find it? and What is the rightmost node of 84?

Please solve

Please solve

What is the maximum height for a binary tree of 1000 nodes?

The table shows the distances, in units of 100 m, between seven houses, A to G. A В D E F G A 4 3 B 4 1 2 4 7 5 1 3 7 D 3 2 6 4 E 2 4 4 2 6 F 7 6 10 G 6 6 7 4 10 Use Prim's algorithm on the table in the insert to find a minimum spanning tree. Start by crossing out row A. Show which entries in the table are chosen and indicate the order in which the rows are deleted. Draw your minimum spanning tree and state its total weight. 4) LO

Please solve

Which ones are correct for the tree T drawn below? (Select all that applies.) look at the picture sent Group of answer choices a) A preorder traversal of the tree yields 100 , 20 , 10 , 30 , 200 , 150 , 300. b) A preorder traversal of the tree yields 100, 20, 30, 10, 200, 150, 300. c) An inorder traversal of the tree yields 10, 20, 30, 100, 150, 200, 300. d) An inorder traversal of the tree yields 10, 20, 100, 30, 150, 200, 300. e) A postorder traversal of the tree yields 10, 30, 20, 100, 150, 300, 200. f) A postorder traversal of the tree yields 10, 30, 20, 150, 300, 200, 100.

Show the list of numbers printed by the Pre-Order Traversal on this tree: 41 20 65 11 29 50 91 3 15 27 32 60 72 99 58