ADS

The number of edges from the root to the node is called __________ of the tree

• Height

• Depth

• Length

• Width

What is a full binary tree?

• Each node has exactly zero or two children

• Each node has exactly two children

• All the leaves are at the same level

• Each node has exactly one or two children

The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is?

• 2^h-1 -1

• 2^h+1 -1

• 2^h +1

• 2^h-1 +1

The no of external nodes in a full binary tree with n internal nodes is?

• n

• n+1

• 2n

• 2n+1

Which of the following statement about binary tree is CORRECT?

• Every binary tree is either complete or full

• Every complete binary tree is also a full binary tree

• Every full binary tree is also a complete binary tree

• A binary tree cannot be both complete and full

Which of the following is false in the case of a spanning tree of a graph G?

• It is tree that spans G

• It is a subgraph of the G

• It includes vertex of the G every

• It can be either cyclic or acyclic

Every graph has only one minimum spanning tree.

• True

• False

Consider a complete graph G with 4 vertices. The graph G has ____ spanning trees.

• 15

• 8

• 16

• 13

The travelling salesman problem can be solved using _________

• A spanning tree

• A minimum spanning tree

• Bellman – Ford algorithm

• DFS traversal

Which of the following is not the algorithm to find the minimum spanning tree of the given graph?

• Boruvka’s algorithm

• Prim’s algorithm

• Kruskal’s algorithm

• Bellman–Ford algorithm