286 Topics
 | |
| | I need to use an array of 5 elements. Each element of the array is a structure with 2 fields: the name of the hotel and a singly linked list of attendees staying in that hotel. Functions are: CheckIn CheckOut Transfer Count Print Quit If someone could just show me … |
| | Hello everyone I have been trying to learn the greater mysteries of linked lists and have come across an error that is inexplicable to me at my current level of understanding. I have written a program that attempts to form a linked list to store student information in the form … |
| | How do i compare two linkedLists so that the onutcome is a sorted linked list from least to greates. Heres my code so far. list1.txt 1 2 3 7 9 10 13 list2.txt 4 5 6 8 11 12 14 how do i compare the two and make it into … |
| | I am having trouble adding information from a ".txt" file to a linked list... here is what i have. list1.txt: 1 2 4 5 6 7 8 11 [CODE] /** The LinkedList1 class implements a Linked list. */ class LinkedList1 { /** The Node class stores a list element and … |
| | how do i read in files from a ".txt" file into a linked list heres my code. [CODE] import java.io.*; public class LinkedList1 { class Node { String element; // list element Node next; // successor link Node(String el, Node n) { element = el; next = n; } Node(String … |
| | I have been asked to create a student database using linked list. this is the question given to me. Write a C/C++ program to perform the task of maintaining student information for 123 College. You are to use a linked-list for storing the students’ information. Each node of the linked-list …  |
| | someone please help me out on this linked list code. it seems not to work out. it is sort of a doubly linked list. look it out. [CODE] #include<stdio.h> #include<stdlib.h> int count = 0; struct node_ptr{ int value; int no; struct node* back; struct node* next; }; struct node_ptr* root; … |
 | Good morning coders !, I stumbled accross an initialization this morning and even though I get it , it's not 100%. I'll simplify it this way: I have an array declaration: [CODE]uint8_t MyArray[MAX_SIZE][/CODE] I have a linked list structure: [CODE]struct MyLL{ struct MyLL * next; struct MyLL * previous; uint16_t … |
| | Hey, I am currently following a code skeleton to implement the missing code for some function. Below is only some part of the implementation I've done so far. Yes it is not much yet... I got stuck for the implementation of the [B]list_add()[/B] function. What I want to do there … |
| | hi guys im creating a dictionary which would show the word and the meaning of the word this is what i have done so far, i created a class called meaning which stores the meaning of the word [code] #ifndef MEANING #define MEANING #include<string> class Meaning { public: Meaning(); ~Meaning(); … |
| | |
| | Hi I have a method that has a reference to a linked list and an int that is the value. I want to recursively call that value to count and return how often that value is in the linked list. So, here is what I got: [CODE]public static int find(LinkedNode … |
| | I was trying to implement a queue using linked list and the problem is when i try to call dequeue() method, nothing shows up and no errors too. just NULL values for all nodes. take a look @ this code and tell me if there is anything wrong... ps. Do … |
| | So, hi, this is my first post here. I can't find a good source for my problem here. My problem: Creating a linked node using classes. I managed to create a list of linked nodes but the problem was that I forgot to delete the nodes I created so now … |
| | . . . . . . . Hi, I am as they say a beginner I need to create a pointer to a linked list as a member variable. I have to tried todo this a number of ways but i dont think i understand the terminology. i have a … |
| | I am writing a method that does insertion into a doubly linked list and I was looking for some assistance with my code to see if I was heading in the write direction and what needs to be fixed to make this work. [B]Instructions[/B] template <class T> Iterator<T> List<T>::insert(Iterator<T> pos, … |
The End.