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

n a binary tree, what is the maximum number of nodes that can be foundin level 3? In level 4? In level 12?

The maximum height of a binary search tree is O(log n), where n is the number of nodes.Group of answer choicesTrueFalse

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

What is the maximum number of nodes at level 'l' in a binary tree?Group of answer choices2^(l+1)l^22^l2^(l-1)

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