To augment a red-black tree, consider storing the following information at each node x of the tree. (You may store additional information as well.) Keys are integers. For each of (a)-(e), answer whether or not it's a good idea to do it, for an efficient augmented red-black tree. Each question is independent. (a) the number of nodes in the left subtree of x good idea O bad idea (b) the product of the number of nodes in the left subtree of x and the number of nodes in the right subtree of x O good idea O bad idea (c) distance from x to the root of the tree O good idea bad idea (d) the number of nodes with key equal to 7 (a fixed constant) in the subtree of x O good idea O bad idea

To augment a red-black tree, consider storing the following information at each node x of the tree. (You may store additional information as well.) Keys are integers. For each of (a)-(e), answer whether or not it's a good idea to do it, for an efficient augmented red-black tree. Each question is independent. (a) the number of nodes in the left subtree of x good idea O bad idea (b) the product of the number of nodes in the left subtree of x and the number of nodes in the right subtree of x O good idea O bad idea (c) distance from x to the root of the tree O good idea bad idea (d) the number of nodes with key equal to 7 (a fixed constant) in the subtree of x O good idea O bad idea

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1.Suppose that we first insert an element x into a binary search tree that does not already contain x. Suppose that we then immediately delete x from the tree. Will the new tree be identical to the original one? If yes, please justify your answers with no more that 3 sentences. If no, please give a counterexample. You may draw pictures if need 2. Draw pictures to show how to construct a red-black tree by inserting the keys in the following sequence into an initially empty red-black tree: 8, 4,10, 9, 5, 17. Show each steps. Please use a double edge indicates a red pointer and single edge indicates a black pointer.
Problem 1. Insert the following set of keys {1, 7, 6, 8, 0, 5, 2, 12, 3, 18} in an empty red-black tree in the order they are listed.
Is the following statement true? Justify your answer. Let B be a binary tree. If for each of its vertices 'v' a data item is inserted into 'v' bigger, than the data item inserted in the left son of the vertex 'v', and at the same time smaller than data item inserted in the right son of the vertex 'v', then B is a search tree.
Consider a B Tree used as an index that has THREE levels including the root node. If a newkey is inserted in this index, then what shall be the maximum number of nodes? Explain youranswer with an example.
This exercise is about drawing BSTs. You are asked to: Show the result of inserting 3, 1, 4, 6, 9, 2, 5, and 7 in an initially empty binary search tree. Then show the result of deleting the root. Draw all binary search trees that can result from inserting permutations of 1, 2 and 3. How many types of trees are there? What are the probabilities of each type of tree’s occurring if all permutations are equally likely Given the input {4371, 1323, 6173, 4199, 4344, 9679, 1989}, a fixed table size of 10, and a hash function H(X) = X mod 10, show the resulting Linear probing hash table Separate chaining hash table
Consider a complete binary tree whose bottom level is completely filled. 1.If the height of this tree is h, what is the number n of nodes in this tree? 2.In terms of n, how many leaves are in this tree? 3.In terms of n or h, how many ancestors does each of the leaves in this tree have? 4.Let d be the depth of a node in this tree. In terms of d and either n or h, how many descendants does each node in this tree have?
Let T1, T2 be 2-3-4 trees and let x be a key [in neither T1, T2], such that for each pair of keys x1 ∈ T1 and x2 ∈ T2, we have x1 < x < x2. Thus, every key in T1 is smaller than every key in T2. Devise an algorithm that constructs the union of x with these two trees. Of course, the trees T1, T2 may be of different height, and the result must be a valid 2-3-4 tree. Your algorithm should run in O(1 + |h(T1) − h(T2)|).
Given an AVL tree containing N positive integers, print out all the even values contained in the tree in descending order (e.g. 12, 8, 6, 2). What will be the time complexity for an efficient algorithm? Please choose the closest bound function.
(1) Create a SINGLE, binary tree using the following three groups of input. After EACH group of input, say whether the tree is full, balanced, and/or complete. PLEASE NOTE you’re only making a SINGLE binary tree in this problem, and answering THREE TIMES. [50,25,30,24,70] [72,71,26,32,22] [56,60,77,54]
For a full 5-ary tree, where n = the number of nodes, i = the number of internal nodes, and l = the number of leaves: find i and l, if n = 996; find n and l, if i = 333; find n and i, if l = 569;
Hey, Why is the binary tree uniquely determined when both the in-order, post-order and pre-order arrangements are given values. In other words: i) Show that if both the inorder and the postorder order are given for a binary tree with unique values, the binary tree is uniquely determined. ii) Show that for a given postorder arrangement binary search trees are unique.
What does the below definations convey?i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.a) weight balanced and height balanced tree definationsb) height balanced and weight balanced tree definationsc) definations of weight balanced treed) definations of height balanced tree