Question 1

ﬁll in the blanks.
-If each edge of $Q _ { 4 }$ has weight 1, then the cost of any spanning tree of minimum cost is ____.

Accepted Answer

15

Question 2

ﬁll in the blanks.
-If T is a full binary tree with 101 vertices, its maximum height is ____.

Accepted Answer

50

Question 3

ﬁll in the blanks.
-There are ____ full binary trees with six vertices.

Accepted Answer

0

Question 4

ﬁll in the blanks.
-The bubble sort has complexity O( ____ ).

Accepted Answer

The answer of ﬁll in the blanks.
-The bubble sort has...

Question 5

ﬁll in the blanks.
-If T is a full binary tree with 101 vertices, its minimum height is ____.

Accepted Answer

The answer of ﬁll in the blanks.
-If T is a...

Question 6

ﬁll in the blanks.
-If T is a full binary tree with 50 leaves, its minimum height is ____.

Accepted Answer

The answer of ﬁll in the blanks.
-If T is a...

Question 7

ﬁll in the blanks.
-If T is a full binary tree with 50 internal vertices, then T has ____ vertices.

Accepted Answer

The answer of ﬁll in the blanks.
-If T is a...

Question 8

ﬁll in the blanks.
-There are ____ non-isomorphic rooted trees with four vertices.

Accepted Answer

The answer of ﬁll in the blanks.
-There are ____ non-isomorphic...

Question 9

ﬁll in the blanks.
-If T is a binary tree with 100 vertices, its minimum height is ____.

Accepted Answer

The answer of ﬁll in the blanks.
-If T is a...

Question 10

ﬁll in the blanks.
-If T is a tree with 999 vertices, then T has ____ edges.

Accepted Answer

The answer of ﬁll in the blanks.
-If T is a...

Question 11

ﬁll in the blanks.
-Every full binary tree with 61 vertices has ____ leaves.

Accepted Answer

The answer of ﬁll in the blanks.
-Every full binary tree...

Question 12

ﬁll in the blanks.
-The best comparison-based sorting algorithms for a list of n items have complexity O( ____ ).

Accepted Answer

The answer of ﬁll in the blanks.
-The best comparison-based sorting...

Question 13

ﬁll in the blanks.
-The value of the arithmetic expression whose preﬁx representation is − 5 / · 6 2 − 5 3 is ____.

Accepted Answer

The answer of ﬁll in the blanks.
-The value of the...

Question 14

ﬁll in the blanks.
-Write 3n − (k + 5) in preﬁx notation: ____.

Accepted Answer

The answer of ﬁll in the blanks.
-Write 3n − (k...

Question 15

ﬁll in the blanks. -C₇ has ____ spanning trees.

Accepted Answer

The answer of ﬁll in the blanks. -C₇ has ____ spanning...

Question 16

ﬁll in the blanks.
-Every 3-ary tree with 13 vertices has ____ leaves.

Accepted Answer

The answer of ﬁll in the blanks.
-Every 3-ary tree with...

Question 17

ﬁll in the blanks.
-Every full binary tree with 50 leaves has ____ vertices.

Accepted Answer

The answer of ﬁll in the blanks.
-Every full binary tree...

Question 18

ﬁll in the blanks.
-There are ____ non-isomorphic trees with four vertices.

Accepted Answer

The answer of ﬁll in the blanks.
-There are ____ non-isomorphic...

Question 19

ﬁll in the blanks.
-The minimum number of weighings with a pan balance scale needed to guarantee that you ﬁnd the single counterfeit coin and determine whether it is heavier or lighter than the other coins in a group of ﬁve coins is ____.

Accepted Answer

The answer of ﬁll in the blanks.
-The minimum number of...

Question 20

ﬁll in the blanks.
-If T is a full binary tree of height h, then the minimum number of leaves in T is and the maximum number of leaves in T is ____.

Accepted Answer

The answer of ﬁll in the blanks.
-If T is a...

Quiz 11: A: Trees

ﬁll in the blanks. -If each edge of Q4Q _ { 4 }Q4​ has weight 1, then the cost of any spanning tree of minimum cost is ____.

ﬁll in the blanks. -If T is a full binary tree with 101 vertices, its maximum height is ____.

ﬁll in the blanks. -There are ____ full binary trees with six vertices.

ﬁll in the blanks. -The bubble sort has complexity O( ____ ).

ﬁll in the blanks. -If T is a full binary tree with 101 vertices, its minimum height is ____.

ﬁll in the blanks. -If T is a full binary tree with 50 leaves, its minimum height is ____.

ﬁll in the blanks. -If T is a full binary tree with 50 internal vertices, then T has ____ vertices.

ﬁll in the blanks. -There are ____ non-isomorphic rooted trees with four vertices.

ﬁll in the blanks. -If T is a binary tree with 100 vertices, its minimum height is ____.

ﬁll in the blanks. -If T is a tree with 999 vertices, then T has ____ edges.

ﬁll in the blanks. -Every full binary tree with 61 vertices has ____ leaves.

ﬁll in the blanks. -The best comparison-based sorting algorithms for a list of n items have complexity O( ____ ).

ﬁll in the blanks. -The value of the arithmetic expression whose preﬁx representation is − 5 / · 6 2 − 5 3 is ____.

ﬁll in the blanks. -Write 3n − (k + 5) in preﬁx notation: ____.

ﬁll in the blanks. -C7 has ____ spanning trees.

ﬁll in the blanks. -Every 3-ary tree with 13 vertices has ____ leaves.

ﬁll in the blanks. -Every full binary tree with 50 leaves has ____ vertices.

ﬁll in the blanks. -There are ____ non-isomorphic trees with four vertices.

ﬁll in the blanks. -The minimum number of weighings with a pan balance scale needed to guarantee that you ﬁnd the single counterfeit coin and determine whether it is heavier or lighter than the other coins in a group of ﬁve coins is ____.

ﬁll in the blanks. -If T is a full binary tree of height h, then the minimum number of leaves in T is and the maximum number of leaves in T is ____.

ﬁll in the blanks. -If each edge of $Q _ { 4 }$ has weight 1, then the cost of any spanning tree of minimum cost is ____.

ﬁll in the blanks. -C₇ has ____ spanning trees.