Fill in the correct answers:

g. The maximum possible height of a binary tree of N nodes is _____

H. The minimum possible height of a binary tree of N nodes is _____

I. The maximum possible number of nodes in a binary tree of height h is _____

J. The number of descendants of the root of a binary tree of N nodes is _____

k. The maximum possible number of ancestors of a node in a binary tree of N nodes is _____

L. The Inorder traversal of a binary search tree (BST) outputs the key values in nondecreasing order.

M. The minimum possible number of nodes in a Heap of height _____ (using the height of root to be 1)

N. The maximum possible number of nodes in a Heap of height h is _____ (using the height of root to be 1)

O. In an AVL tree of N nodes, the search and insert operations can be performed in (Big-O) _____