Question # 1

If a complete binary tree has height h then its no. of nodes will be,

Choose an answer

Log (h)

2^h+1 - 1

Log (h) - 1

2^h - 1

In complete binary tree the bottom level is filled from________

Choose an answer

Left to right

Right to left

Not filled at all

None of the given option

Double link list is always has one NULL pointer

Choose an answer

True

False

Not Sure

Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?

Choose an answer

4,6,7,5

6,7,5,4

4,5,6,7

4,6,5,7

The maximum number of external nodes for a binary tree of height H is

Choose an answer

2^h

2^h+1

2^h+2

2^h+3

The difference between the binary tree and a binary search tree is that:

Choose an answer

a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node

in binary search tree nodes are inserted based on the values they contain

in binary tree nodes are inserted based on the values they contain

none of these

Which of the following statement is correct property of binary trees?

Choose an answer

A binary tree with internal nodes has N+1 internal links

A binary tree with N external nodes has 2N internal nodes.

A binary tree with N internal nodes has N+ 1 external node.

None of above statement is a property of the binary tree.

By using _____ we avoid recursive method of traversing a tree,which makes use of stacks and consumes a lot of memory and time.

Choose an answer

Binary tree only

Threaded binary tree

Heap data structure

Huffman encoding

If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?

Choose an answer

54

55

56

57

Which of the following statement is correct?

Choose an answer

A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor.

The arguments passed to a function should match in number, type and order with the parameters in the function definition.

Choose an answer

True

False

both

More Classes

Other Links

CS-301 Final Term Exams Preparation Virtual University MCQs With Answers

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer