Please help me with the textbook solution... Textbook solutions for Data Structu
ID: 655440 • Letter: P
Question
Please help me with the textbook solution...Textbook solutions for Data Structures Abstreaction and Design Using Java 2nd Edition Chapter 10 Problem 8PP
A third possible representation of a graph is to use the TreeSet class to contain the edges. By defining a comparator that compares first on the source vertex and then the destination vertex, we can use the subSet method (of the TreeSet class) to create a view that contains only edges originating at a specified vertex and then use the iterator of that view to iterate through edges. Design and implement a class that meets the requirements of the Graph interface and uses a TreeSet to hold the edges.
Explanation / Answer
size(left) <= ?*size(node)
size(right) <= ?*size(node)
Where size can be defined recursively as:
function size(node)
if node = nil
return 0
else
return size(node->left) + size(node->right) + 1
end
An ? of 1 therefore would describe a linked list as balanced, whereas an ? of 0.5 would only match almost complete
binary trees.
A binary search tree that is ?-weight-balanced must also be ?-height-balanced, that is
height(tree) <= log1/?(NodeCount)
Scapegoat trees are not guaranteed to keep ?-weight-balance at all times, but are always loosely ?-height-balance in
that
height(scapegoat tree) <= log1/?(NodeCount) + 1