(a) Suppose we create a binary search tree by inserting the following values in the given order: 50,10, 13,45,55, 110,5,31,64, and 47. Answer the following questions: (i) Draw the binary search tree. (ii) Show the output values if we visit the tree using pre-order traversal technique. (iii) Show the output values if we visit the tree using post-order traversal technique. (iv) Show the resulting trees after we delete 47, 110, and 50. (Each deletion is applied on the original tree.)

(a) Suppose we create a binary search tree by inserting the following values in the given order: 50,10, 13,45,55, 110,5,31,64, and 47. Answer the following questions: (i) Draw the binary search tree. (ii) Show the output values if we visit the tree using pre-order traversal technique. (iii) Show the output values if we visit the tree using post-order traversal technique. (iv) Show the resulting trees after we delete 47, 110, and 50. (Each deletion is applied on the original tree.)

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

Kruskal's Algorithm: Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. This algorithm is a Greedy Algorithm. The steps to find a MST using this algorithm are as follows: Sort all the edges in non-decreasing order of their weight. Pick the smallest edge. Check if it forms a cycle with the spanning tree formed so far. If cycle is not formed, include this edge. Else, discard it. Repeat step2 until there are (V-1) edges in the spanning tree. Example with 10 vertices and 20 weighted edges:
If I construct a binary search tree with the following data: 2 6 12 17 19 32 45 63, How many leaf nodes are in the tree?
Draw the binary search tree if the pre-order and in-order traversals of that binary search tree are given as below: Pre-order traversal: 7, 4, 2, 3, 6, 5, 12, 9, 8, 11, 19, 15, 20 In-order traversal: 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 19, 20
What are the lowest and highest nodes if a binary search tree comprises n nodes? Justify your solution using mathematical reasoning.
= Suppose that we have a B and the size of the search key field V is equal to 10 bytes, the size of the data (record) pointer Pr 6 bytes, and the tree (block) pointer P is 5 bytes and the value of p (the order or the maximum number of a tree pointers in a node) is equal to 20 for an internal node. a) Calculate the block size (B) b) Suppose that we have a B- tree instead of B and based on the block size found in question (a), calculate the order (p) for an internal node in this case.
profile-image Time remaining: 00 : 09 : 49 Computer Science Design a greedy algorithm according to the scenario below and answer the following question (We don't need a code here just a complete explanation considering the facts below) We have an L feet long tree which has n branches. We have a list of branch's height [h1, h2, h3, ..., hn] where hi
Please show steps clearly
Suppose we have the following Binary Search Tree. 12 4 16 14 18 10 11 Algorithm Write up. Write an algorithm to determine the leaf nodes of the given tree reclusively. Output: The leaf nodes of the given tree are: 29 11 14 18
4. Write a recursive algorithm in pseudocode that finds the lowest common ancestor (LCA) of two given nodes in a binary tree T. The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself). If either p or q is null, the LCA is null. For this problem, Nodes have left, right, and parent references as well as a field called level which stores the level of the node in the tree. In the sample tree below, node 5 is on level 0, while nodes 4 and 6 are on level 1. Write your solution here. 5 <- level 0 4 6 < level 1 function lowest_common_ancestor (Node P, Node q)
Consider the following binary search tree: 5 10 17 20 30 If the value 9 were inserted into this tree, where in the tree would it be inserted? ○ It would be the left child of the node containing 17 It would be the right child of the node containing 17 It would be the right child of the node containing 5 It would be the new left child of the node containing 10