If a binary tree is both a max-heap and an AVL tree, what is its largest possible number of nodes, assuming all keys are different?

The maximum number of nodes in acomplete binary tree i

Which of the following is an advantage of the AVL tree, compared to the binary heap?

Where is the maximum number in a binary search tree? a) At the root of the tree. b) Anywhere other than root and leaf nodes c) At the leftmost leaf node. d) At the rightmost leaf node

What is the maximum height of an AVL tree with p nodes?

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