Dont use others answers please!!follow the directions on the photowill leave you feedback!!Thank you! Problem #1:a) Create a TreeNode class with the following methods: default constructor, twooverloaded constructors, copy constructor, getValue, getleft, getRight, setValue,setLeft, setRightb) Create a BTInterface with the following abstract methods: getRoot, setRoot,isEmpty, swapSubtrees, singleParent, preorder, postOrder, inOrder, insertc) Create an abstract BinaryTree class that implements the interface. Include thedefault constructor, a private helper method called checkNode for singleParent() andtoString. Make insert an abstract method.d) Derive a BinarySearch Tree class from BinaryTree with the following methods: defaultconstructor, overloaded constructor (use a variable iength parameter), insert,e) Create a Treedemo class that creates two BinarySearch Tree objects. Use default andoverloaded constructors. For tree one: call the methods make Tree (makes a completetree), print Tree, swapSubtrees, printTree. Simliar for tree two. Also, print out thenumber of single parents in each tree. Define make Tree and print Tree in this class.Problem #2a)Create a HeapPriorityQueue interface with the following abstract methods:isEmpty, isFull, enqueue, dequeue, reheapifyUpward, reheapifyDownward, reposition.b)Create the HeapPriorityQueue class. Have heapArray hold maxSize of 250 entries.Also, include the methods: default constructor, toString.c)Create HeapOverflowException and HeapUnderflowException classesd) Create a HeapDemo class that creates a HeapPriorityQueue object and insert thevalues 1-10 into the heap. Print out the heap and remove two values from the heap.Print the resulting heap. Try and show the resulting tree with the nodes on theirappropriate levels along with their branches. 1. Given the two binary trees below:14)4(15)(18)16)(20)(17Write a method called swapSubtrees, which swaps all of the left and rightsubtrees in the above binary trees. Adc this method to the class Binary Treeand create a program to test this method for these 2 trees. Show the originaltrees and the resulting trees.Note: To test your algorithm, first create a binary search tree.- Write a method called singleParent, which returns the number of nodes in abinary tree that have only one child for the 2 trees given in the above. Add thismethod to the class Binary Tree and create a program to test this method.Note: To test your algorithm, first create a binary search tree.2. Start with an empty heap, and enter ten items with priorities 1 through 10.Draw the resulting heap.- Now remove three entries from the heap that you created in the aboveexercise. Draw the resulting heap.

As per our guidelines we can only provide solution for one ques but here I m providing one solution…

1. Given the two binary trees below: 4 (15) (18) 16 (20 5) 17 Write a method called swapSubtrees, which swaps all of the left and right subtrees in the above binary trees. Adc this method to the class Binary Tree and create a program to test this method for these 2 trees. Show the original trees and the resulting trees. Note: To test your algorithm, first create a binary search tree. - Write a method called singleParent, which returns the number of nodes in a binary tree that have only one child for the 2 trees given in the above. Add this method to the class Binary Tree and create a program to test this method. Note: To test your algorithm, first create a binary search tree. 2. Start with an empty heap, and enter ten items with priorities 1 through 10. Draw the resulting heap. - Now remove three entries from the heap that you created in the above exercise. Draw the resulting heap.

1. Given the two binary trees below: 4 (15) (18) 16 (20 5) 17 Write a method called swapSubtrees, which swaps all of the left and right subtrees in the above binary trees. Adc this method to the class Binary Tree and create a program to test this method for these 2 trees. Show the original trees and the resulting trees. Note: To test your algorithm, first create a binary search tree. - Write a method called singleParent, which returns the number of nodes in a binary tree that have only one child for the 2 trees given in the above. Add this method to the class Binary Tree and create a program to test this method. Note: To test your algorithm, first create a binary search tree. 2. Start with an empty heap, and enter ten items with priorities 1 through 10. Draw the resulting heap. - Now remove three entries from the heap that you created in the above exercise. Draw the resulting heap.

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

C++ Consider the binary search tree in the figure below. The numbers simply label the nodes so that you can reference them; they do not indicate the contents of the nodes. The answer to this question is the node position to the left of the node (the numbers 1-31). Beginning with an empty binary search tree, consider the binary search tree that is formed when you insert the following values in the order given: B, T, E, A, N, W, J At what position is N?
224.Consider the following statements: a. Kruskal’s algorithm might produce a non-minimal spanning tree. b. Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure. a is true but b is false Both a and b are false Both a and b are true b is true but a is false
3.2.5 Assume we are given the option to insert the search keys in any order we like and that we are aware of how frequently a BST will need to access them.Should the keys be added to the tree in a different order, or in order of decreasing likelihood of access? Describe your response. 3.2.6 Add the tree's height-calculating method height() to BST. Create two implementations: a recursive method that adds a field to each node in the tree and takes linear space and constant time every query, and a method similar to size() that takes linear space and constant time per query. 3.2.5 Assume we are given the option to insert the search keys in any order we like and that we are aware of how frequently a BST will need to access them.Should the keys be added to the tree in a different order, or in order of decreasing likelihood of access? Describe your response. 3.2.6 Add the tree's height-calculating method height() to BST. Create two implementations: a recursive method that adds a field to each…
Need help with this java programming homework Please Example C 9.37 Suppose two binary trees, T1 and T2, hold entries satisfying the heap-order prop- erty (but not necessarily the complete binary tree property). Describe a method for combining T1 and T2 into a binary tree T, whose nodes hold the union of the entries in T1 and T2 and also satisfy the heap-order property. Your algorithm should run in time O(h1 + h2) where h1 and h2 are the respective heights of T1 and T2.
Please answer the following, #6 (in bold) . Number 5 is linked to #6, but i only need number 6 NOT 5. Write clearly please. 5. Create a height-balanced binary search tree from the following sorted array. 1 5 9 11 12 13 15 18 19 6. Consider from the previous questions the height balanced binary search trees created from sorted arrays. Creating this balanced tree gives a tree with an efficient search time for any value it holds. If I wanted to find the range of the data (difference between largest and smallest item), how long would it take to do this with the binary search tree? Explain your answer with a single sentence. (Give the answer relative to input size n, but not in Big O notation).
Q5. a. A binary search tree may be balanced or unbalanced based on the arrangement of the nodes of the tree. With you knowledge in Binary search tree:i. Explain the best and worst case scenarios of the time and space complexity of both type of binary trees above.b. Using your knowledge in binary tree traversals, implement the following tree traversing algorithms in either Java or C++, i. inorder, ii. preorder iii. and postorder traversal
In DrRacket: Define the difference between Binary Search Trees and Nodes? A) A Binary Search Tree is a Node, but a Node isn’t always a Binary Search Tree. B) A Node is a Binary Search Tree, but a Binary Search Tree isn’t always a Node. C) Binary Search Trees may contain Nodes, but Nodes cannot contain Binary Search Trees. D) Nodes may contain Binary Search Trees, but Binary Search Trees cannot contain Nodes. E) They are the same thing
Dear Sir, Please Help me to solve the given question. Question: Implement (C++ code) of the red-black tree, which has the following operations. Insertion operation: Insert at least 8 values in a red-black tree. Deletion operation: Delete 3 different nodes from a red-black tree you have created. Make sure, after the deletion, the remaining tree must be a red-black tree. Searching operation: Search elements in the red-black tree you have created.
Consider the initial B+ tree index shown below. The number of pointers in a node is 3. Draw the B+ tree for each of following operations (in total there should be two trees): (1) insert ‘10’; (2) delete ‘17’. (Each of the operations, besides (1), must be performed on the B+ tree drawn for the previous operation and (1) must be performed on the following B+ tree). I need the carrect answer as soon as possible please
Object is name(age,time) For example : apple (1,11) the Binary tree order depend on age Write a java code that would add a new node to the tree in the leaf position where binary search determines a node for d should be inserted. To build fix the trees so that the properties of the max heap are maintained (i.e. the parent node must have higher adoption priority than its children). This means that we need to perform upheap if needed. Note that since this is also a binary search tree, we need to make sure that when performing upheap we don’t break the properties of the binary search tree. To ensure this, instead of performing upheap as seen in class, we will need to implement a tree rotation that reverses the parent-child relationship whenever necessary. Depending if the child that has to be swap in the parent position is the left or the right child, we will need to perform a right rotation or a left rotation
332 File structures and DatabaseShow the B+-tree of order three (namely each node has a maximum of threekeys/descendents) that result from loading the following sets of keys in order:a. M, I, Tb. M, I, T, Q, L, H, R, E, Kc. M, I, T, Q, L, H, R, E, K, Pd. M, I, T, Q, L, H, R, E, K, P, C, A
USING C++, Implement a TEMPLATED Binary Search Tree (BST) (RECURSIVE OPERATIONS REQUIRED) class called intBst, which stores integers. Provide the following recursive operations: Insert, Delete tree, Search, inOrder traversal, preOrder traversal, postOrder traversal. Would Delete tree be public or private? Methods that are essential for the correct operation of the tree in terms of managing memory must be provided. Any additional methods can be added. Your Bst.h file for this exercise will now have: template <class T> class Bst{… /// declaration of methods and data members of class Bst with doxygen comments }; // rest of the code in Bst.h with normal (non-doxygen) code comments As this is a template class, there is no Bst.cpp. As Node stores the data, Node will also be implemented as a template. Test your template BST with an integer data file. Change the declaration in your test program (main) to: Bst<int> intTree; // rest of the code The data file will contain non-sorted…