Chapter 11: Q4E (page 769)
How many comparisons are needed to locate or to add each of the words in the search tree for Exercise 2, starting fresh each time?
a) palmistry
b) etymology
c) paleontology
d) glaciology
Short Answer
a)3
b)3
c)3
d)3
Chapter 11: Q4E (page 769)
How many comparisons are needed to locate or to add each of the words in the search tree for Exercise 2, starting fresh each time?
a) palmistry
b) etymology
c) paleontology
d) glaciology
a)3
b)3
c)3
d)3
All the tools & learning materials you need for study success - in one app.
Get started for freeAnswer these questions about the rooted tree illustrated.
a) Define a full \(m{\bf{ - }}\)ary tree.
b) How many vertices does a full \(m{\bf{ - }}\)ary tree have if it has \({\bf{i}}\) internal vertices\(?\) How many leaves does the tree have?
Show that a center should be chosen as the root to producea rooted tree of minimal height from an unrooted tree.
Draw the subtree of the tree in Exercise \(4\)that is rooted at
\(\begin{array}{l}{\bf{a}})a.\\b)c.\\c)e.\end{array}\)
What is wrong with the following โproofโ using mathematical induction of the statement that every tree with \({\bf{n}}\) vertices has a path of length \({\bf{n - 1}}\). Basis step: Every tree with one vertex clearly has a path of length \(0\). Inductive step: Assume that a tree with \({\bf{n}}\) vertices has a path of length \({\bf{n - 1}}\), which has \({\bf{u}}\) as its terminal vertex. Add a vertex \({\bf{v}}\) and the edge from \({\bf{u}}\)to \({\bf{v}}\). The resulting tree has \({\bf{n + 1}}\) vertices and has a path of length \({\bf{n}}\). This completes the inductive step.
What do you think about this solution?
We value your feedback to improve our textbook solutions.