If a tree has N levels, then the height of the tree is N - 1.Group of answer choicesTrueFalse

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

A full binary tree of height n has _________________ leaves. A. 2n B. 2n C. 3(n+1) D. 2(n+1) E. 3n

Consider a binary tree with n nodes, where each node can have at most two children. The height of the tree is defined as the maximum number of edges between the root node and any leaf node. Which of the following statements is true regarding the height h of this binary tree?*The height of the tree is always equal to n-1The height of the tree is always equal to log₂(n)The height of the tree can be greater than or equal to n-1

n a height-balanced tree, what is the minimum height of a leaf node?a)It depends on the number of elements in the tree.b)1c)0d)-1

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