71) A binary tree of depth d is an almost complete binary tree if

72) If each node in a tree has value greater the every value in its left sub-tree and has value less than every value in its right sub-tree, the tree is called

73) The number of nodes in a complete binary tree of level 5 is

74) The maximum number of nodes on level i of a binary tree is

75) The smallest number of key that will force a B-tree of order 3 to have a height 3 is