E LinearFamily Tree.java >public class LinearFamilyTree {V TRAVERSALE Lineartamily Tree javaA QUESTION.pngpublic LinearFamilyTree () {4.public string linearize(BinaryTree n) {1617181920I LinkedBinaryTree.java 3 •E BinaryTree.java >.public interface BinaryTreecE> {EXPLORERI Binary Treejava x...V BINARYTREEE BinarytreejavaBinary IreeNode javaE LinkedDinaryTree java1BinaryTreeNode getRoot();public void addRoot (E element);public hoolean hasRoot ();33P LinkedBinary TreeNode.java6.E QUESTION.png7} Implement the print method in the LinearFamilyTree class (below). For a given BinaryTree representing the ancestors, the linearize method shouldreturn a String representing the family tree as in the example below. So make sure to both print the family tree and return the printed String.Input tree:FatherMotherGrandmaGrandpaOutput String:(1( Father ) ( Mother ( Grandma ) ( Grandpa ) ) ).IMPORTANT: Only upload the file LinearFamilyTree.java

import java.util..*; class LinearFamilyTree { static class Node { int data; Node left, right; };…

Implement the print method in the LinearFamilyTree class (below). For a given BinaryTree representing the ancestors, the linearize method should return a String representing the family tree as in the example below. So make sure to both print the family tree and return the printed String. Input tree: Father Mother Grandma Grandpa Output String: (1( Father ) ( Mother ( Grandma ) ( Grandpa ) ) ). IMPORTANT: Only upload the file LinearFamilyTree.java

Implement the print method in the LinearFamilyTree class (below). For a given BinaryTree representing the ancestors, the linearize method should return a String representing the family tree as in the example below. So make sure to both print the family tree and return the printed String. Input tree: Father Mother Grandma Grandpa Output String: (1( Father ) ( Mother ( Grandma ) ( Grandpa ) ) ). IMPORTANT: Only upload the file LinearFamilyTree.java

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

Write an application to test the HuffmanTree class. Your application will need to read a text fileand build a frequency table for the characters occurring in that file. Once that table is built, createa Huffman code tree and then a string consisting of '0' and '1' digit characters that represents the code string for that file. Read that string back in and re‐create the contents of the original file
Find the given code of Binary Search Tree from our class. Use it for the offline. Don't change anything that is already given, but you can add something (variable or function) if you need. Implement these functions a. tree_successor b. tree_delete You can check your code by experimenting with different values. Menu for successor and delete function is already added in the main function.
Write a method isBST() that takes a Node as argument and returns true if the argument node is the root of a binary search tree, false otherwise.Hint : This task is also more difficult than it might seem, because the order in which youcall the methods in the previous three exercises is important.Write a method isBST() that takes a Node as argument and returns true if the argument node is the root of a binary search tree, false otherwise.Hint : This task is also more difficult than it might seem, because the order in which youcall the methods in the previous three exercises is important.
Java code that eliminates the binary search's node with the lowest value. returns a reference to its element from a tree. If this tree is empty, it raises an EmptyCollectionException. If the tree is empty, returning a reference to the node with the fewest values produces an EmptyCollectionException.
Add more methods to the singly linked list class then test them• search(e) // Return one node with 3 values (stuID, stuName, stuScore) which matches agiven key e (studentID).• addAfter(e, stuID, stuName, stuScore) //Add a new node with 3 values (stuID,stuName, stuScore) after the node with the key e (studentID).• removeAt(e) //Remove a node which matches a given key e (studentID)• count() //Return a number of nodes of list.• update(stuID, stuName, stuScore) //Update the values of one node public class SlinkedList<A,B,C> { private Node head; private Node tail; private int size; public SlinkedList(){ head=null; tail=null; size=0; } public int getSize(){ return size; } public boolean isEmpty(){ return size == 0; } public A getFirstStuId(){ if(isEmpty()) return null; return (A) head.getStuID();}public B getFirstStuName(){ if(isEmpty()) return null; return (B)…
T9: On old cell phones, users typed on a numeric keypad and the phone would provide a list of words that matched these numbers. Each digit mapped to a set of 0 - 4 letters. Implement an algorithm to return a list of matching words, given a sequence of digits. You are provided a list of valid words (provided in whatever data structure you'd like). The mapping is shown in the diagram below: 1 EXAMPLE Input: 8733 Output: tree, used 4 ghi 7 pqrs 2 abc bc 5 jkl 8 tuv 0 3 def 6 mno 9 wxyz
Add more methods to the singly linked list class then test them• search(e) // Return one node with 3 values (stuID, stuName, stuScore) which matches agiven key e (studentID).• addAfter(e, stuID, stuName, stuScore) //Add a new node with 3 values (stuID,stuName, stuScore) after the node with the key e (studentID).• removeAt(e) //Remove a node which matches a given key e (studentID)• count() //Return a number of nodes of list.• update(stuID, stuName, stuScore) //Update the values of one node three codes below two in pictures one,typed out. public class SlinkedList<A,B,C> { private Node head; private Node tail; private int size; public SlinkedList(){ head=null; tail=null; size=0; } public int getSize(){ return size; } public boolean isEmpty(){ return size == 0; } public A getFirstStuId(){ if(isEmpty()) return null; return (A) head.getStuID();}public B getFirstStuName(){ if(isEmpty())…
Write a program to implement phone book dictionaryusing Binary Search Tree which provides followingoperations: (a) add new entry in phone book, (b)remove entry from phone book, (c) search phonenumber (d) list all entries in ascending order of nameand (e) list all entries in descending order of name.
Java / Trees: *Please refer to attached image* What is the inorder of this tree? Multiple chocie. G X C A N V F Q L W G X C A N V F L W E A C V N X G F L W E A C V N VG F L W E
This needs to be in java. Thanks. You are to implement a binary search tree data structure. Your program should have a minimum of three classes (the node, the tree, and a driver). Your program should include the following abilities: Ability to add each name into a binary tree node – one at a time. Place each node into the tree following the general algorithm for binary tree insertion. (The minimum list of names to be used is on the next page). You may have the program load the names via a file read OR by hard code. In either case, you must enter the names 1 at a time using the “add” method you designed. Names will be read in/added in the EXACT order that they are listed. Ability to delete any name from the tree – one at a time. Ability to print out the tree in either order (alpha and reverse alpha) Ability to “search” the tree for a specific name. Return the number of probes (i.e. a look at a node). Each time you look at a node, it is considered a “probe”. Ability to “destroy”…
Add more methods to the doubly linked list class then test them• search(e) // Return one node with 3 values (stuID, stuName, stuScore) which matches agiven key e (studentID).• addAfter(e, stuID, stuName, stuScore) //Add a new node with 3 values (stuID,stuName, stuScore) after the node with the key e (studentID).• removeAt(e) //Remove a node which matches a given key e (studentID)• count() //Return a number of nodes of list.• update(stuID, stuName, stuScore) //Update the values of one node two codes below package DlinkedList; class Node<A,B,C> { private A stuID; private B stuName; private C stuScore; private Node<A,B,C> next; private Node <A,B,C> prev; public Node(A id, B name, C score) { stuID = id; stuName = name; stuScore = score; next = null; prev = null; } public A getStuID() { return stuID; } public B getStuName() { return stuName; } public C getStuScore() { return stuScore; } public Node<A,B,C> getNext(){ return next; } public Node<A,B,C>…
You are creating from scratch a binary search tree class with the methods insert, find, and delete in addition to the method getRandomNode(), which retrieves a random node from the tree. There should be an equal chance of selecting each node. Create a getRandomNode algorithm, put it into practise, and describe how you'd develop the other functions.