The number of different binary trees that can be made from two nodes that contain the key values 41 and 92 is 4.Group of answer choicesTrueFalse

The number of different binary search trees that can be made from two nodes that contain the key values 31 and 32 is 2.Group of answer choicesTrueFalse

How many possible binary search trees can be made with the keys 1, 2, 3?123456Submit

What is the minimum number of children a node can have in a binary tree?Group of answer choices0123

A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24, 49 The number of nodes in the left subtree and right subtree of the root respectively is a. (8, 4) b. (4, 7) c. (7, 4) d. (4, 8)

Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?*2 points1234