Chapter 11: Q3E (page 769)
How many comparisons are needed to locate or to addeach of these wordsin the search tree for Exercise 1, starting fresh each time?
a) pear
b) banana
c) kumquat
d) orange
Short Answer
a) 3
b) 1
c) 4
d) 5
Chapter 11: Q3E (page 769)
How many comparisons are needed to locate or to addeach of these wordsin the search tree for Exercise 1, starting fresh each time?
a) pear
b) banana
c) kumquat
d) orange
a) 3
b) 1
c) 4
d) 5
All the tools & learning materials you need for study success - in one app.
Get started for freeWhen Kruskal invented the algorithm that finds minimumspanning trees by adding edges in order of increasing weightas long as they do not form a simple circuit, he also inventedanother algorithm sometimes called the reverse-delete algorithm. This algorithm proceeds by successively deletingedges of maximum weight from a connected graph as long asdoing so does not disconnect the graph.
Express the reverse-delete algorithm in pseudocode.
Suppose that \({{\bf{d}}_{\bf{1}}}{\bf{,}}{{\bf{d}}_{\bf{2}}}{\bf{,}}...{\bf{,}}{{\bf{d}}_{\bf{n}}}\) are n positive integers with sum \({\bf{2n - 2}}\). Show that there is a tree that has n vertices such that the degrees of these vertices are \({{\bf{d}}_{\bf{1}}}{\bf{,}}{{\bf{d}}_{\bf{2}}}{\bf{,}}...{\bf{,}}{{\bf{d}}_{\bf{n}}}\).
In Exercises 2โ6 find a spanning tree for the graph shown byremoving edges in simple circuits.
In Exercises 2โ6 find a spanning tree for the graph shown by removing edges in simple circuits.
Give an upper bound and a lower bound for the height of a B-tree of degree k with n leaves.
What do you think about this solution?
We value your feedback to improve our textbook solutions.