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

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will beQuestion 49Select one:(n+1)/2cross outn/2-1cross outn/2+1cross out(n-1)/2

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:a.2^(h+1) -1b.2^h -1c.2^(h-1) – 1d.2*(h+1)

The height of a binary search tree is the length of the ________ path from the root to a leaf.

Suppose a binary tree is constructed with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be

What would be the minimum possible height of the binary search tree with elements [2, 5, 6, 4, 8, 3, 9]  if you are allowed to insert in any order?