2 adding functionality Extend the BinarySearchTree class:1 Write code for the method search(int key, Node root)2 Write code for the method insert(int key, Node root)3 Write code for the method delete(int key, Node root)4 Write code for a main method to build a BSTTest your code with the input in the worked example. Necessary information below: class Node{// attributesint ID;String name; Node left; // left child Node right; // right child }class BinarySearchTree{// attributesNode root;// methodssearch(int key, Node root);void insert(int key, Node root);void delete(int key, Node root);}}

2 adding functionality Extend the BinarySearchTree class:1 Write code for the method search(int key, Node root)2 Write code for the method insert(int key, Node root)3 Write code for the method delete(int key, Node root)4 Write code for a main method to build a BSTTest your code with the input in the worked example. Necessary information below: class Node{// attributesint ID;String name; Node left; // left child Node right; // right child }class BinarySearchTree{// attributesNode root;// methodssearch(int key, Node root);void insert(int key, Node root);void delete(int key, Node root);}}

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

10. Given the definition of a binary tree Node, write a method that returns the height ofa given node.Class TreeNode {Int value;TreeNode left;TreeNode right;}Static int height (TreeNode position) { }** Use only the definition of a TreeNode, don’t suppose we have other built-inmethods.
Finish the following programs. Given the definition of SListNode: public class SListNode extends ListNode { protected SListNode next; //next references the next node in the SList. SListNode(Object i, SList l, SListNode n) { item = i; myList = l; next = n; } // Ignore other methods in this exam. We don't use them. … } Finish the definitions of a constructor, prev(), newNode(), insertFront(), front(), back(), toString() methods of the SList class. Note: SListNode and SList implement a singly-linked list by inheriting from ListNode class and List class, respectively. Whenever a SListNode is needed to be created, use newNode() method defined in SList class rather than calling the SListNode constructor directly. public class SList extends List { protected SListNode head; protected SListNode tail; //You need to write a constructor for SList with no parameters. public SList() { } // newNode() calls the SListNode constructor to…
2. What should the parameter type be in each of the following methods? setData() --> setLeft() --> setRight() --> 3. What would need to be added/removed/changed to make this class work for a more general tree such that each node could have more than 2 nodes? EXERCISE 2 4. What is the base case of the size() method? What are the recursive cases? 5. What is the main difference between the 3 methods: inorder(), preorder(), and postorder()? 6. In the recFormatTree() method, what is the space parameter used for? What is the default value when this method is first called? What is being concatenated to this space value in the recursive calls? Does this make sense for how the tree is being displayed? EXERCISE 3 7. How can you tell if a given node is a leaf node?
Implement a class for Circular Doubly Linked List (with a dummy header node) which stores integers in unsorted order. Your class definitions should look like as shown below:class CDLinkedList;class DNode {friend class CDLinkedList;private int data;private DNode next;private DNode prev;};class CDLinkedList {private:DNode head; // Dummy header nodepublic CDLinkedList(); // Default constructorpublic bool insert (int val); //Inserts val at end into the linked list.Time complexity:O(1)public bool removeSecondLastValue ();//Note: Remove the Second last val from the linked list. Time complexity: O(1)public void findMiddleValue(); // find middle value of the linklist and delete it.public void display(); // Displays the contents of linked list on screen …};
Implement a class for Circular Doubly Linked List (with a dummy header node) which stores integers in unsorted order. Your class definitions should look like as shown below:class CDLinkedList;class DNode {friend class CDLinkedList;private int data;private DNode next;private DNode prev;};class CDLinkedList {private:DNode head; // Dummy header nodepublic CDLinkedList(); // Default constructorpublic bool insert (int val); //Inserts val at end into the linked list.Time complexity:O(1)public bool removeSecondLastValue ();//Note: Remove the Second last val from
Implement LeafNode and InteriorNode classes for the expression tree as discussed on this page Use this template: Please don't change any function namesAdd any methods if necesssaryTODO: Remove the pass statements and implement the methods. '''class LeafNode:def __init__(self, data):self.data = datadef postfix(self):return str(self)def __str__(self):return str(self.data)def prefix(self):passdef infix(self):passdef value(self):return self.dataclass InteriorNode:def __init__(self, op, left_op, right_op):self.op = opself.left_op = left_opself.right_op = right_opdef postfix(self):return self.left_op.postfix() + " " + self.right_op.postfix() + " " + self.opdef prefix(self):passdef infix(self):passdef value(self):passif __name__ == "__main__":# TODO: (Optional) your test code here.a = LeafNode(4)b = InteriorNode('+', LeafNode(2), LeafNode(3))c = InteriorNode('*', a, b)c = InteriorNode('-', c, b)
Java - Write a non-member method for a "enqueue" that utilizes a doubly linked list. There are three variables available (can be sent) to the method; a “front” reference, a “rear” reference, and a data element (string) (you decide what you need). Empty case is when front and rear are NULL. The node is defined as follows: class node{ node after; node before string data }
package circularlinkedlist;import java.util.Iterator; public class CircularLinkedList<E> implements Iterable<E> { // Your variablesNode<E> head;Node<E> tail;int size; // BE SURE TO KEEP TRACK OF THE SIZE // implement this constructorpublic CircularLinkedList() {} // I highly recommend using this helper method// Return Node<E> found at the specified index// be sure to handle out of bounds casesprivate Node<E> getNode(int index ) { return null;} // attach a node to the end of the listpublic boolean add(E item) {this.add(size,item);return false; } // Cases to handle// out of bounds// adding to empty list// adding to front// adding to "end"// adding anywhere else// REMEMBER TO INCREMENT THE SIZEpublic void add(int index, E item){ } // remove must handle the following cases// out of bounds// removing the only thing in the list// removing the first thing in the list (need to adjust the last thing in the list to point to the beginning)// removing the last…
This Java code does not run, it has some errors and it needs a main method, please fix it. import java.io.*; class DecisionTree { /* NESTED CLASS */ private class BinTree { /* FIELDS */ private int nodeID;private String questOrAns = null;private BinTree yesBranch = null;private BinTree noBranch = null; /* CONSTRUCTOR */ public BinTree(int newNodeID, String newQuestAns) {nodeID = newNodeID;questOrAns = newQuestAns;}} /* OTHER FIELDS */ static BufferedReader keyboardInput = newBufferedReader(new InputStreamReader(System.in));BinTree rootNode = null; /* Default Constructor */ public DecisionTree() {} /* CREATE ROOT NODE */ public void createRoot(int newNodeID, String newQuestAns) {rootNode = new BinTree(newNodeID,newQuestAns);System.out.println("Created root node " + newNodeID);} /* ADD YES NODE */ public void addYesNode(int existingNodeID, int newNodeID, String newQuestAns) {// If no root node do nothing if (rootNode == null) {System.out.println("ERROR: No root node!");return;} // Search…
Given the interface of the Linked-List struct Node{ int data; Node* next = nullptr; }; class LinkedList{ private: Node* head; Node* tail; public: display_at(int pos) const; ... }; Write a definition for a method display_at. The method takes as a parameter integer that indicates the node's position which data you need to display. Example: list: 5 -> 8 -> 3 -> 10 display_at(1); // will display 5 display_at(4); // will display 10 void LinkedList::display_at(int pos) const{ // your code will go here }
Write c++ code Create a BST where each node stores the rollNumber and marks of a student. Your task is toprovide the implementation of following methods.constructorinsertRecord() functionupdateRecord() functioncountOfPassedStudents()showData() functioninside main() function, create an object of BST class.Insert the following data and create the BST according to the marks.● 19L-1941, 71 should be the root node● 19L-1942, 62● 19L-1943, 67● 19L-1944, 54● 19L-1945, 58● 19L-1946, 45● 19L-1947, 29● 19L-1948, 76● 19L-1949, 81● 19L-1950, 92Update the data of following record● Marks of 19L-1944 are 54. Update the marks to 47● Marks of 19L-1949 are 81. Update the marks to 85Call the countOfPassedStudents(). You can either display the count in the same function orreturn the value to main function.Call the showData() function to display all the records of BST in preorder traversal.Note: It is not mandatory to create a template class
Add the following method in the BST class that returns aniterator for traversing the elements in a BST in preorder./** Return an iterator for traversing the elements in preorder */java.util.Iterator<E> preorderIterator()