b) Draw a complete binary tree and then build the min-heap tree from the followingdata, where x= last two digits of your student id+100, y=x+30, and z=x+y. Finally, sort the datain descending order using the heapsort algorithm.last two digits student id = 8510 x 20 8 y zc) Two disjoint sets {y, p, z, x} and {r, t} are given, where maximum one of a set is therepresentative of that set. Determine UNION(Find(x), Find(t)). How can you check x and y arein the same set using Find operation? Here, x=last two digits of your student id+2, y=x+3,Z=x+y, p=y+z, r=x+2, t=900.last two digits student id = 85%D

b) Draw a complete binary tree and then build the min-heap tree from the following data, where x= last two digits of your student id+100, y=x+30, and z=x+y. Finally, sort the data in descending order using the heapsort algorithm. last two digits student id = 85 10 x 20 8 y z

b) Draw a complete binary tree and then build the min-heap tree from the following data, where x= last two digits of your student id+100, y=x+30, and z=x+y. Finally, sort the data in descending order using the heapsort algorithm. last two digits student id = 85 10 x 20 8 y z

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

java binary tree: Given the following binary search tree, what would be the sequence of nodes, if traversed using inorder traversal after deleting 8.
Consider the following statements. S1. Kruskal's algorithm might produce a non-minimal spanning tree. S2. Kruskal's algorithm can efficiently implemented using the disjoint- set data structure. (a) S1 is true but S2 is false (b) Both S1 and S2 are false (c) Both S1 and S2 are true (d) S2 is true but S1 is false
Create a min-heap from a binary search tree. Use the following binary search tree to demonstrate the method.
Write the pre-order, in-order and post-order traversals of the following binary search tree:
Please show steps clearly
Name= WASIF-GUL
A 1 14 B 15 Q.No.4. C 3 16 4 Q 17 Consider the following alphabet with equivalent code number. 18 F 6. 19 a) Design a binary search tree of your Full Name( let take this as a Name (WASIF-GUL)) by taking its equivalent digit and provide a post order traversal of it. The code for blank space is 0. G 20 8. 21 V 22 W 23 24 10 K 11 X L Y 25 b) Write algorithms for the following functions (in 26 binary search tree) I. that counts the number of nodes in a binary search tree II. that sums up all the keys in a binary search tree 213
The purpose of this assignment is to practice (JAVA): Implement a binary search tree structure Demonstrate tree traversals Analyze and compare algorithms for efficiency using Big-O notation For this project, you will implement a binary search tree and use it to store a large text file (JAVA). Your program should read text from a file and insert each word in a binary search tree. Do not store duplicate text. Once the tree is populated, print the contents of the tree using an in-order traversal. Next, allow the user to enter words to search for. For each word entered, your program should report the number of elements inspected and whether or not the word was located. Next, allow the user to enter words to remove from the tree. After each removal, print the contents of the tree. Provide an analysis of your remove and search algorithms using Big-O notation. Be sure to provide justification for your claims. (Look at image attached for sample run)
Recall that the set of full binary trees is defined as follows:
1. A Binary Search Tree (BST) is a binary tree where each node contains a value from a well-ordered set. (a) Draw a BST for each of the following set of data: i. 20, 30, 45, 31, 19, 15, 18, 13, 50, 21 i. М, О, R, T, С, F, E, A, S, N, Q
Please show steps clearly
Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follows: //check pic// You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree. Hints: Header file typedef char ElemType; typedef struct node//define the type of binary tree node { }BTnode; Source file #include <stdio.h> #include <stdlib.h> #include "tree.h" BTnode * createTree()//create the binary tree，return the root { BTnode *tnode;// tnode is the root char elem; ;//input the character //if the input is a space，set the pointer as NULL Else// if the input is not a space，generate the binary node and create its left…