section ALook at the class definitions below and answer the questions based on it: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);}a. Create two files Node.java and BinarySearchTree.javab. Copy the above definitions into the corresponding filesc.Compute(Write) a code for a default and a loaded constructor for Noded. Compute(Write) a code for a default and a loaded constructor for BinarySearchTreee. Compute(Write) a an accessor and mutator methods for the attributes of Nodef. Compute(Write) a accessor and mutator methods for the attributes of BinarySearchTree

section ALook at the class definitions below and answer the questions based on it: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);}a. Create two files Node.java and BinarySearchTree.javab. Copy the above definitions into the corresponding filesc.Compute(Write) a code for a default and a loaded constructor for Noded. Compute(Write) a code for a default and a loaded constructor for BinarySearchTreee. Compute(Write) a an accessor and mutator methods for the attributes of Nodef. Compute(Write) a accessor and mutator methods for the attributes of BinarySearchTree

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 10PE

See similar textbooks

Similar questions

Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…
Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java and attach output screen with program: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: classBSTNode { Node left; Node right; int data; publicBSTNode(int _data);// assign data to_data and assign left and right node to null } class BST { BSTNoderoot; public BST();// assign root to null void insert(int data);// this function insert the data in tree which maintain property of BST boolean Search(int key); this function search the data in bst and return true if key is found else return false public void EvenPrint(Node n)// this function only print the data which are even, make this function resursive public void OddPrint(Node n)// this function only print the data which are odd, make this function resursive public void PrimePrint(Node n)// this function only…
Tree Define a class called TreeNode containing three data fields: element, left and right. The element is a generic type. Create constructors, setters and getters as appropriate. Define a class called BinaryTree containing two data fields: root and numberElement. Create constructors, setters and getters as appropriate. Define a method balanceCheck to check if a tree is balanced. A tree being balanced means that the balance factor is -1, 0, or 1.
X1222: Double Ended Queue: Deque A double ended queue, known as deque, is a queue data structure that allows adding and removing elements from both ends of the queue. Instead of enqueue and dequeue, it has insert, delete, and get for both front and last of the queue as shown below. The data stored internally is stored in a ListNodesPlus object. The basic class definition is shown below: public class Deque { private ListNodePlus elements; // code ommitted for space public void clear() {...}; public int numElements () {...}; public boolean isEmpty() {...}; ● // Implement the following four methods public void insertFront (E it) { } public E deleteFront () { } public void insertLast (E it) { } public E deleteLast() { } Write the following four methods: • insertFront (E it) takes it and adds it to the front of the queue. stored internally in elements. The front of the queue is defined as position 0 in the queue. ● deleteFront () removes the element at the front of the queue and returns it.…
1- Create a struct to store the node label and its cost:struct Node{char label;int cost;};SCS214: Data StructuresAssignment-42- Implement a class MinHeap that has the following declaration:3- Create a class WeightedGraph, which stores a graph using an adjacency matrixwith the following declaration:class WeightedGraph{ int** g; int nVertices;public:int getNVertices();//returns the number of vertices int getWeight(char,char);//returns weight of the edge connecting the givenvertices int* returnNeighbors(int v);// returns the indices of the neighbors of the vertexv as an int array int numNeighbors(int v);//returns the number of neighbors of the vertex v void loadGraphFromFile(ifstream&);//allocates the adjacency matrix & initializesedge weights from the specified file void dijkstra(char startVertex, char* prev, Node distances[] );//find the shortestpath from the start vertex to all other vertices, by filling the prev array and thedistances array};class MinHeap{ Node* heap; //an…
java program: University of Bahrain College of Information Technology Department of Computer Science Second Semester, 2020-2021 ITCS214 / ITCS215 / ITCS216 (Data Structures) Assignment 3 Implement generic class ArrayStack as discussed in the lectures having following methods: constructor, push, pop, peek, isEmpty, copy constructor, reallocate (private method). Also add following methods to this class: size: returns number of elements in the stack. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Implement generic class ArrayQueue as discussed in the lectures having following methods: constructor, copy constructor, offer, poll, peek, isEmpty, reallocate(private), iterator. Inner class Iter that implements interface Iterator having methods: constructor, hasNext, next. Also add following methods to the ArrayQueue class: size: returns number of elements in the queue. contains: Search…
IN c++ See the specification of the HugeInt class.Complete the implementation of this class.Provide a driver to demonstrate the features of the HugeInt class. HugeInt.h #ifndef HUGEINT_H_#define HUGEINT_H_ enum SignType {PLUS, MINUS}; class HugeInt{private: struct Node { int digit; // SINGLE DIGIT ONLY ie: (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) Node *next; // Next More Significant Digit }; /* Integer 345 is stored in List: 3 <- 4 <- 5 <- digits Integer 123 is stored in List: 1 <- 2 <- 3 <- digits To add: add the least significant digits, potentially keeping track of a carry value. Then move to the next left nodes in both HugeInts. Add these and the carry. Create a new carry value. Continue until both HugeInt lists are empty. If one list is empty, keep processing the non-empty list. */ Node *digits; //Linked list of digit nodes SignType sign; //enum of the sign of the HugeInt int…
Salesforce Assignment: You are working in company as a junior developer and the manger assign you a task to create the test class of trigger code of the following code will cover all the use case like insert, update, delete. The code is as follows: public class TriggerBasicAssignmentTriggerHelper ( // This method is used to update the vlaue of field C public static void getFiledvalue(List listofValues, Map mapofCoustomobject ){ for (Trigger_Basic_Assignments_ct :listofvalues){ if(mapofCoustomobject == null || t.Field_A_c != mapofCoustomobject.get(t.Id). Field_A_C || t.Field_8_c != mapofCoustomobject.get(t.I if(t.Operator_ '+') t.Field C_c = t.Field_A_c + t.Field_B_c; else if(t.Operator_c *') t. Field C_c = t.Field A_* t.Field_8_c; else if(t.Operator_c == /' && t.Field B_c != 0) t.Field C_c = t.Field A_c / t.Field_B_c; else t.Field C_c = t.Field_A_c - t.Field B_c; I need the test class only.
Software Requirements: • Latest version of NetBeans IDE • Java Development Kit (JDK) 8 Procedure: 1. our progras from rhFactor non-static and private. Remove the constructor with two (2) parameters. 2o upply uncapsutation Make bloodType and 2. The names of the public setter and getter methods should be: • setBloodType() • setRhFactor() getBlood Type() getRhFactor() 3. Use the setter methods to accept user input. 4. Display the values by calling the getter methods. Sample Output: Enter blood type of patient: Enter the Rhesus factor (+ or -): O+ is added to the blood bank. Enter blood type of patient: B Enter the Rhesus factor (+ or -): B- is added to the blood bank.
Unique Words (Python) It seems like we need to use linked lists. Summary Specifications:You are tasked to implement an abstract data type class which takes in a given input file called input.txt, and processes, identifies and sorts all unique word instances found in the file. Sample InputHi hello hi good bye goodbye Bye bye good say Sample OutputBye Hi bye hello hi say The input.txt file is found along with the zip folder where this instructions file also came along with. Note: you are not allowed to use pythonic lists, and its methods and functions, and string methods. However the use of the file handling methods (read readlines and readline) are allowed for this project.
My data structure doesn't seem to work, please help me Data.h: #pragma once class List{private:typedef struct node{int data; node* next; }* nodePtr;nodePtr head;nodePtr curr; nodePtr temp; public: List();void AddNode(int addData);void DeleteNode(int delData);void PrintList();};Implementation.cpp: #include <iostream>#include "Data.h"using namespace std; List::List(){head = NULL;curr = NULL;temp = NULL;}void List::AddNode(int addData){nodePtr n = new node;n->next = NULL;n->next = addData;if(head !=NULL){curr = head;while(curr->next !=NULL){curr = curr->next;}curr->next = n;}else{head = n;} }void List::DeleteNode (int delData){nodePtr delPtr = NULL;temp = head;curr = head;while (curr != NULL && curr->data != delData){temp = curr;curr = curr->next;}if (curr == NULL){cout << delData << "is not on the list\n";delete delPtr;}else{delPtr = curr;curr = curr->next;temp->next = curr;if (delPtr == head){head = head->next;temp = NULL;}delete…
Write Java code Objectives •Use an abstract data type for a list •Use a method that contains an Object type as a formal parameter •Use methods in an existing class •Access data members within a class Required Files: •ListInterface.java •ListException.java •ListOutOfBoundsException.java •ListArrayBased.java Description A list is an abstract data type used to store ordered data, and contains operations that fall into the following categories: (1) add data to a data collection, (2) remove data from a data collection, and (3) ask questions about data in a data collection. The operations which ask questions about the data in a data collection may include operations that determine if a data collection is empty, determine the size of a data collection, and retrieve the item at a given position in a data collection. A list should be able to contain any type of object. The methods for the List support any object as specified in the interface. In this assignment, the objects will be S trings.…