Consider the following statements. (i)A binary tree can contain at least 2L Nodes at level L.(ii) A complete binary tree of depth d is a binary tree that contains 2L Nodes at each level L between 0 and d, both inclusive. (iii) The total number of nodes (Tn ) in a complete binary tree of depth d is 2 d+1 - 1 . (iv) The height of the complete binary tree can be written as h = log 2 (Tn+1)-1 where Tn is Total number of Nodes. Which one of the following is correct in respect of the above statements regarding the Binary trees?

Consider the following statements.

(i)A binary tree can contain at least 2L Nodes at level L.

(ii) A complete binary tree of depth d is a binary tree that contains 2L Nodes at each level L between 0 and d, both inclusive.

(iii) The total number of nodes (Tn ) in a complete binary tree of depth d is 2 d+1 - 1 .

(iv) The height of the complete binary tree can be written as h = log 2 (Tn+1)-1 where Tn is Total number of Nodes.

Which one of the following is correct in respect of the above statements regarding the Binary trees?

A. (i) and (iii) only B. (i), (ii) and (iii) only C. (ii) and (iii) only D.

(ii), (iii) and (iv)

Similar Questions

A queue where the delimiter -queue operation depends not on FIFO, is called a priority queue

False

True

The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

Use better data structures

Increase the hard disk space

Use the better algorithm

Use as much data as we can store on the hard disk

Consider the function X as under

int X (int& Value) 
{ 
return Value; 
}

Now a and b are integers in a calling function. Which one of the following is a valid call to the above function X.

a = X (b) ;

B. a = X (&b) ; C.

a = X (*b) ;

None of the given optionions

In the call by value methodology, a copy of the object is passed to the called function.

False

True

The tree data structure is a

Linear data structure

Non-linear data structure

Graphical data structure

D. Data structure like queue

When should you use a const reference parameter?

Whenever the parameter has huge size.

B. Whenever the parameter has huge size, the function changes the parameter within its body, and you do NOT want these changes to alter the actual argument. C.

Whenever the parameter has huge size, the function changes the parameter within its body, and you DO want these changes to alter the actual argument.

Whenever the parameter has huge size, and the function does not change the parameter within its body.

Here is the start of a C++ class declaration:

class foo 
     { 
  public: 
void x(foo f);
void y(const foo f); 
void z(foo f) const;

Which of the three member functions can alter the PRIVATE member variables of the foo object that activates the function?

Only x can alter the private member variables of the object that activates the function.

Only y can alter the private member variables of the object that activates the function.

Only z can alter the private member variables of the object that activates the function.

Two of the functions can alter the private member variables of the object that activates the function.

What is the maximum depth of recursive calls a function may make?

n (where n is the argument)

D. There is no fixed maximum

Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,

Log2 (n+1) -1

B. Log2 (n+1) C.

Log2 (n)-1

Log2 (n)

10.

In the linked list implementation of the stack class, where does the push member function places the new entry on the linked list?

At the head

At the tail

After all other entries that are greater than the new entry.

After all other entries that are smaller than the new entry.

DATA STRUCTURES TOPICS