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

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

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

The maximum number of levels that a binary search tree with 3 nodes can have is 2.Group of answer choicesTrueFalse

A binary search tree is generated by inserting following integers: 41, 30, 60, 25, 78, 90, 39, 50The number of nodes in the left subtree and right subtree of the root respectivelyA3, 4B5, 3C3, 5D4, 4

In a Binary Search Tree, the left subtree of a node contains only nodes with keys _______ the node’s key.