(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

A. Show the result of inserting 7, 10, 2, 4, 5, 11, 1, 8, 9, 6, 12, 3 into an initially empty binary search tree (in that order). 1. Which node is the root? II. Which nodes are the leaves? III. Which nodes are siblings? IV. What is the depth of each node? V. What is the height of each node? B. Show the result of deleting the root.
1.What are the different methods for traversing a binary tree and what is the difference between them? 2.How do these traversal algorithms help in solving problems related to binary trees? 3.Provide examples of problems that can be solved using each traversal method.
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:
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
Please show steps clearly
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
5. For the following binary tree: a. List the node numbers for traversing the tree using the preorder traversal method. b. List the node numbers for traversing the tree using the inorder traversal method. c. List the node numbers for traversing the tree using the postorder traversal method.
Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75
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
Please show steps clearly
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