In a binary tree, if the number of leaf nodes is $6,$ and the total number of edges is $15,$ how many nodes have one child only?

a$.6$

b$.4$

c$.7$

d$.5$

How many edges for a completed graph with $6$ nodes?

a$.9$

b$.18$

c$.12$

d$.15$

Select the option of choice that "best" completes the statement, matches the item, or answers the question.

A subgraph that contains all of original vertices

A form of rectangular table containing boolean elements

Visiting Left child first, then the Right child before the node itself

There is an edge for every node$-$pair

A graph that contains only arcsWhich of the following is correct regarding a binary search tree?

a$.$ The major property of binary search trees is that the pre$-$order traversal of the trees sorts the keys of all nodes in their logical order $($ascending$).$

b$.$ The keys of all the nodes in the left subtree are larger than that of the root node.

c$.$ The keys of all the nodes in the left subtree are larger than that of the root node.

d$.$ The keys of all the nodes in the left subtree are larger than that of the root node.

Clear my choice

Which statement is not true?

a$.$ Both tree and graph are non$-$linear data structure

b$.$ A graph is a special type of tree

c$.$ There is weighted tree and there is weighted graph

d$.$ A tree is a special type of graph

Clear my choice

Which of the following is true about minimum spanning trees?

a$.$ A minimum spanning tree can have multiple edges between the same pair of vertices.

b$.$ A minimum spanning tree is always unique for a given graph.

c$.$ A minimum spanning tree includes all vertices of the graph.

d$.$ A minimum spanning tree includes all edges of the graph.