Describe a modification to the binary search-tree data structure that would support the following two index-based operations for a sorted map in O(h) time, where h is the height of the...
Popular Questions - Uncategorized
1. Draw a splay tree, T1, together with the sequence of updates that produced it, and a red-black tree, T2, on the same set of ten entries, such that a preorder traversal of T1 would be the same as...
1. The boolean indicator used to mark nodes in a red-black tree as being “red” or “black” is not strictly needed when we have distinct keys. Describe a scheme for implementing a red-black tree...
1. Give a complete justification of Proposition 12.1.2. In the merge-sort tree shown in Figures 12.2 through 12.4, some edges are drawn as arrows. What is the meaning of a downward arrow? How about...
1. How many different binary search trees can store the keys {1,2,3}?2. Dr. Amongus claims that the order in which a fixed set of entries is inserted into a binary search tree does not matter—the...
1. Draw an example of a red-black tree that is not an AVL tree.2. Give a proof of Proposition 11.93. Give a proof of Proposition 11.10
Recent Comments