Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Related questions
Concept explainers
Question
Thank you!
C++ please
Transcribed Image Text:LinkedAssemble
Editor
1 node* assemble(vector<string parts)
//fill in code here
This problem provides asks you to assemble a linked list. The linked list
will be composed of node objects chained together via node pointers. Each
node has a next pointer which points to the next node in the chain. The
last node is identified by having a NULL (or nullptr) next pointer. The
linked lists for this problem store string data
4
Given a vector of strings, create a linked list containing the strings from
the vector, in the same order as in the vector. For this problem, compose
your linked lists from nodes using the following class declaration (this is
already available to the autograder code; do not copy this into your
solution)
class node
public:
string data;
node* next;
d:
Notes and Constraints
. The input vector parts contains between 0 and 50 strings, inclusive
Examples
["apple", "orange", "banana", "pear"
return "apple->orange->banana->pear-NULL
Test
Submit
Expert Solution
Trending nowThis is a popular solution!
Step by stepSolved in 7 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
import java.util.LinkedList;
public class IntTree { private Node root;
private static class Node { public int key; public Node left, right;
public Node(int key) { this.key = key; } }
public void printInOrder() { printInOrder(root); }
private void printInOrder(Node n) { if (n == null) return; printInOrder(n.left); System.out.println(n.key); printInOrder(n.right); }
// Recall the definitions of height and depth. // in the BST with level order traversal "41 21 61 11 31", // node 41 has depth 0, height 2 // node 21 has depth 1, height 1 // node 61 has depth 1, height 0 // node 11 has depth 2, height 0 // node 31 has depth 2, height 0 // height of the whole tree is the height of the root
/* * Returns the height of the tree. For example, the BST with level order * traversal 50 25 100 12 37 150 127 should return 3. * * Note that the height of…
arrow_forward
import java.util.LinkedList;
public class IntTree { private Node root;
private static class Node { public int key; public Node left, right;
public Node(int key) { this.key = key; } }
public void printInOrder() { printInOrder(root); }
private void printInOrder(Node n) { if (n == null) return; printInOrder(n.left); System.out.println(n.key); printInOrder(n.right); }
// Recall the definitions of height and depth. // in the BST with level order traversal "41 21 61 11 31", // node 41 has depth 0, height 2 // node 21 has depth 1, height 1 // node 61 has depth 1, height 0 // node 11 has depth 2, height 0 // node 31 has depth 2, height 0 // height of the whole tree is the height of the root
/* * Mutator functions HINT: This is easier to write if the helper function * returns Node, rather than void similar to recursive mutator methods on lists.
*…
arrow_forward
import java.util.LinkedList;
public class IntTree { private Node root;
private static class Node { public int key; public Node left, right;
public Node(int key) { this.key = key; } }
public void printInOrder() { printInOrder(root); }
private void printInOrder(Node n) { if (n == null) return; printInOrder(n.left); System.out.println(n.key); printInOrder(n.right); }
// Recall the definitions of height and depth. // in the BST with level order traversal "41 21 61 11 31", // node 41 has depth 0, height 2 // node 21 has depth 1, height 1 // node 61 has depth 1, height 0 // node 11 has depth 2, height 0 // node 31 has depth 2, height 0 // height of the whole tree is the height of the root
/* * Returns true if for every node in the tree has the same number of nodes to * its left as to its right. For example, the BST with level order traversal 50 *…
arrow_forward
import java.util.LinkedList;
public class IntTree { private Node root;
private static class Node { public int key; public Node left, right;
public Node(int key) { this.key = key; } }
public void printInOrder() { printInOrder(root); }
private void printInOrder(Node n) { if (n == null) return; printInOrder(n.left); System.out.println(n.key); printInOrder(n.right); }
/* * Returns the number of nodes with odd keys. For example, the BST with level * order traversal 50 25 100 12 37 150 127 should return 3 (25, 37, and 127). */ public int sizeOdd() { // TODO throw new RuntimeException("Not implemented"); }
• You are not allowed to use any kind of loop in your solutions. • You may not modify the Node class in any way• You may not modify the function headers of any of the functions already present in the file.• You may not add any fields to the IntTree…
arrow_forward
import java.util.LinkedList;
public class IntTree { private Node root;
private static class Node { public int key; public Node left, right;
public Node(int key) { this.key = key; } }
public void printInOrder() { printInOrder(root); }
private void printInOrder(Node n) { if (n == null) return; printInOrder(n.left); System.out.println(n.key); printInOrder(n.right); }
/* * Returns the number of nodes with odd keys. For example, the BST with level * order traversal 50 25 100 12 37 150 127 should return 3 (25, 37, and 127). */ public int sizeOdd() { return sizeOddHelper(root) { }
private int sizeOddHelper(Node odd) { // TODO throw new RuntimeException("Not implemented"); }
arrow_forward
import java.util.LinkedList;
public class IntTree { private Node root;
private static class Node { public int key; public Node left, right;
public Node(int key) { this.key = key; } }
public void printInOrder() { printInOrder(root); }
private void printInOrder(Node n) { if (n == null) return; printInOrder(n.left); System.out.println(n.key); printInOrder(n.right); }
/* * Returns the number of nodes with odd keys. For example, the BST with level * order traversal 50 25 100 12 37 150 127 should return 3 (25, 37, and 127). */ public int sizeOdd() { // TODO throw new RuntimeException("Not implemented"); }
arrow_forward
import java.util.LinkedList;
public class IntTree { private Node root;
private static class Node { public int key; public Node left, right;
public Node(int key) { this.key = key; } }
public void printInOrder() { printInOrder(root); }
private void printInOrder(Node n) { if (n == null) return; printInOrder(n.left); System.out.println(n.key); printInOrder(n.right); }
/* * Returns the number of nodes with odd keys. For example, the BST with level * order traversal 50 25 100 12 37 150 127 should return 3 (25, 37, and 127). */ public int sizeOdd() { // TODO throw new RuntimeException("Not implemented"); }
• You are not allowed to use any kind of loop in your solutions. Only recursions. • You may not modify the Node class in any way• You may not modify the function headers of any of the functions already present in the file.• You may not add any fields…
arrow_forward
Given the following function and a Linked List : head->a->b->c->d->e->f->g->null, where a,...g are
void fun1(Node head) {
if(head == null) return;
System.out.printf("%d ", head.data);
fun1(head.link.link);
} What does the call fun1(head) do? Binary search tree properties.
arrow_forward
Write a code for a simple text editor/Nodepad.
Use fully connected linked list, with four pointers next,prev,up and down.
Note: Use linkedlist DSA C++ and also file handling.
Please complete the requirements. I asked this question multiplie times before. I don't want incorrect answer this time.
arrow_forward
(java)create a generic node class. create another class called op, that contains methods to add or delete nodes in any location.
arrow_forward
Simple linkedlist implementation
please help (looks like a lot but actually isnt, everything is already set up for you below to make it EVEN easier)
help in any part you can be clear
Given an interface for LinkedList- Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of LinkedList interface provided- For the implementation create a tester to verify the implementation of thatdata structure performs as expected
Build Bus Route – Linked List- You’ll be provided a java package containing an interface, data structure,implementation shell, test harness shell below.- Your task is to:o Implement the LinkedList interface (fill out the implementation shell)o Put your implementation through its paces by exercising each of themethods in the test harnesso Create a client (a class with a main) ‘BusClient’ which builds a busroute by performing the following operations on your linked list:o§ Create (insert) 4 stations§…
arrow_forward
Write a Python Code for the given function and conditions:
(Use LinkedList Manipulation)
Given function: def remove(self, deletekey) (4)
Pre-condition: List is not empty.
Post-condition: Removes the element from a list that contains the deleteKey and returns the deleted key value.
arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education