Suppose that the search for key k in a binary search tree ends in a leaf. Consider three sets: A, the keys to the left of the search path; B, the keys on the search path; and C, the keys to the right of the search path. Give a counterexample to the claim that any three keys a € A, b e B, and c e C

Suppose that the search for key k in a binary search tree ends in a leaf. Consider three sets: A, the keys to the left of the search path; B, the keys on the search path; and C, the keys to the right of the search path. Give a counterexample to the claim that any three keys a € A, b e B, and c e C

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

Consider a binary search tree (BST) whose elements are the name of animals. Starting with an empty BST, show the effect of successively adding the following elements: cow, fox, bat, ant, lion, cat, goat, dog,and pig. Show the effect of successively deleting fox, cow,and bat from the resulting BST and Traverse the original BST in pre-order, in-orderand post-order.
Draw the portion of the state space tree generated by LCBB for the following instances. n = 4, m = 15, (P₁, ..., P) = (10, 10, 12, 18) (w₁,..... W 4) = (2, 4, 6, 9).
Computer Science Consider a left-child, right-sibling tree T containing n nodes, in which each node stores, among other information, a real number >0, called the node’s score. Find a subset S of all nodes such that the sum of the scores of nodes in S is maximized subject to the constraint that a node and its child cannot both be in S. 1. In C++, write a function to solve the max sum for the nodes with the conditions given. 2. Analyze the running time
Consider a binary search tree (BST) whose elements are the integer values: Starting with an empty BST, show the effect of successively adding the following elements: 15, 78, 10, 5, 12, 82, 60, 68, 11 and 65. Show the effect of successively deleting 10, 78, and 15 from the resulting BST. Traverse the original BST in pre-order and post-order.
Consider the array t = [1, 2, 3, 4, 5, 8, 0 , 7, 6] of size n = 9, . a) Draw the complete tree representation for t. b) What is the index of the first leaf of the tree in Part a (in level order)? In general, give a formula for the index of the first leaf in the corresponding complete binary tree for an arbitrary array of size n. c) Redraw the tree from Part a after each call to fixheap, in Phase 1 of heapsort. Remember, the final tree obtained will be a maxheap. d) Now, starting with the final tree obtained in Part c, redraw the tree after each call to fixheap in Phase 2 of heap sort. For each tree, only include the elements from index 0 to index right (since the other elements are no longer considered part of the tree). e) For the given array t, how many calls to fixheap were made in Phase 1? How many calls to fixheap were made in Phase 2? f) In general , give a formula for the total number of calls to fixheap in Phase 1, when heapsort is given an arbitrary array of size n. Justify…
We have a connected graph G=(V,E), and a specific vertex u∈V. Suppose we compute a depth-first search tree rooted at u, and obtain a tree T that includes all nodes of G. Suppose we then compute a breadth-first search tree rooted at u, and obtain the same tree T. Prove that G=T. (In other words, if T is both a depth-first search tree and a breadth-first search tree rooted at u, then G cannot contain any edges that do not belong to T.)
Let T be a binary search tree whose keys are all distinct. Suppose T is created by inserting each key into the growing tree. Let x be a leaf node and y be its parent node. Show that if x is the right child of y, then y.key is the largest key in T smaller than x.key. (Hint: Show that the assumption that there is another node z whose key satisfies y.key < z.key < x.key will lead to a contradiction.)
Let S : S --> {true, false} be a function that inputs a full binary search tree and outputs either true or false, defined as follows. B. If X is a binary search tree consisting only of a single vertex, then S(X ) = true if this vertex equals pork and S(X ) = false otherwise. R. If X is a binary tree with root v, left subtree Xl and right subtree Xr , then S(X ) = true if v equals pork. Otherwise, if v < pork, then S(X ) = S(Xr ). If v > pork, then S(X ) = S(Xl ).
Consider an input: 5, 3, 10, 7, 8, 4, 1, 13, 11, 2, 15, 16 Create a Binary Search Tree (Read the input from left to right) Write in-order traversal of the tree Delete node 10 and redraw the tree B2. a. Find a closed form for the generating function for the given sequence 4, 16, 64, 256, … B2. b. Find the coefficient of x^9 in the power series of this function f(x)=1/(1-2x)^2 B2. c. What is the probability that a bit string of length 8 has exactly four 1’s?
Let T be an arbitrary splay tree storing n elements A1, A2, . An, where A1 ≤ A2 ≤ . . . ≤ An. We perform n search operations in T, and the ith search operation looks for element Ai. That is, we search for items A1, A2, . . . , An one by one. What will T look like after all these n operations are performed? For example, what will the shape of the tree be like? Which node stores A1, which node stores A2, etc.? Prove the answer you gave for formally. Your proof should work no matter what the shape of T was like before these operations.
Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described asa) log2 nb) log4/3 nc) log3 nd) log3/2 n
A binary tree is \emph{full} if every non-leaf node has exactly two children. For context, recall that we saw in lecture that a binary tree of height $h$ can have at most $2^{h+1}-1$ nodes and at most $2^h$ leaves, and that it achieves these maxima when it is \emph{complete}, meaning that it is full and all leaves are at the same distance from the root. Find $\nu(h)$, the \emph{minimum} number of leaves that a full binary tree of height $h$ can have, and prove your answer using ordinary induction on $h$. Note that tree of height of 0 is a single (leaf) node. \textit{Hint 1: try a few simple cases ($h = 0, 1, 2, 3, \dots$) and see if you can guess what $\nu(h)$ is.}