Question: Which of the following is incorrect with respect to binary trees?

Options

A : Let T be a binary tree. For every k ? 0, there are no more than 2k nodes in level k

B : Let T be a binary tree with ? levels. Then T has no more than 2? – 1 nodes

C : Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))

D : Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))

Click to view Correct Answer

Previous || Next

Data Structure Binary Tree Properties more questions

Thyristor controlled starter is preferred over DOL starter due to....

In a masonry wall, the strength of the mortar should....

In analog receivers, noise bandwidth is _________ signal bandwidth.

The C-O-C bond angle in ethers is _______

The _____ the uncertainty, the ______ is the information content.

Which of the following RNAs are highly conserved?

Each word consist of a sequence of ____________

If the bacterial DNA sequence is Leu Met Att Gal....

Which of the following amino acids are exclusively ketogenic?

Which of the following yields acetyl co-A via aceto-acetyl co-A?

Data Structure Adjacency List more Online Exam Quiz

Data Structure Avl Tree

Data Structure Balanced Partition

Data Structure Binary Heap

Data Structure Binary Search Iterative

Data Structure Binary Search Tree

Data Structure Binary Trees Array

Data Structure Binary Trees Linked Lists

Data Structure Binomial Fibonacci Heap

Data Structure Bit Array

Data Structure Breadth First Search