Which of the following is incorrect with respect to binary trees?OptionsLet T be a binary tree. For every k ≥ 0, there are no more than 2k nodes in level k Let T be a binary tree with λ levels. Then T has no more than 2λ – 1 nodesLet T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))

Let T be a binary tree. The nodes in level k can be at most 2k, where k ≥ 0.Let T be a binary tree with λ levels. Then T has no more than 2^λ – 1 nodesLet T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))

n a binary tree, what is the maximum number of nodes that can be foundin level 3? In level 4? In level 12?

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

What is the maximum number of nodes at level 'l' in a binary tree?Group of answer choices2^(l+1)l^22^l2^(l-1)

What is the minimum number of children a node can have in a binary tree?Group of answer choices0123