linked-list

问题 I've been searching for many hours on how to add linked list data to a Jtable but none of the results I found were satisfying. I'm trying to teach myself java so it's a bit difficult for me. Anyways, here is my code. I know it's probably really bad so please be patient with me and help me in making it better. public class node { public node next,pre; public String name; public double price; public node (String n,double p){ this (n,p,null,null); } public node (String n,double p, node ne,node

问题 Closed . This question needs to be more focused. It is not currently accepting answers. Want to improve this question? Update the question so it focuses on one problem only by editing this post. Closed 5 years ago . I'm working on a C++ program that is supposed to utilize a linked list to create a hypercard stack (whatever that is). The problem is, I have no idea what I'm doing. I've written some code, but it crashes, and honestly I have no idea if it even meets the specifications for what I

问题 I've already created the Binary Tree and Linked list classes, I'm just in need of an algorithm that prints ONLY the nodes of the largest path. The height and size of the Binary Tree are already stored in the root node, but my problem is traversing only the largest path while adding each node to my linked list. 回答1: I assume your binary tree nodes have a reference to their parent, is that right? Then you could use either a breadth-first search or a depth-first search and find root nodes where

问题 This question already has answers here : Sorting a linked list in C (6 answers) Closed 5 years ago . I would to ask you, if it is possible to simple sort alphabetically linked list with names? I think that it is possible, but i dont know how. Can you help me with that? I will be very thankful. "i" pressed should scan new name and add this name to linked list and then to sort this list alphabetically "d" pressed should to display entire sorted list "k" pressed program ends I did this with

问题 I'm trying to construct a simple Linked List but I get a compile error telling me the Linked List node I'm trying to access doesn't contain the field I expect it to. These are my Linked List methods: typedef struct TinCan { int label; } TinCan; typedef struct LinkedListNode { TinCan *data; struct LinkedListNode *next; } LinkedListNode; typedef struct LinkedList { LinkedListNode *head; } LinkedList; LinkedList* createList() /*creates empty linked list*/ { LinkedList* myList; myList =

问题 I am implementing Abstract Data Type - Priority que, but I can't find out how to put values in correct order. My structures: typedef int kintyr; typedef struct qElem { struct qElem *prv; kintyr *dat; int *priority; }qElem; typedef struct que { qElem *fr,*bk; int cnt; }que; And now my main functions to implement a Priority que First to create an empty PQ: que *qNew() { que *q = malloc(sizeof(*q)); if (q==NULL) return NULL; q->fr = NULL; q->bk = NULL; q->cnt = 0; qFault = 0; return q; } This is

问题 When I don't use the "insertBefore" method, it just prints out the linked list normally like it is supposed to. But when I try to use the insertBefore method, it does work for the first part but then it keeps printing the link list as if it goes on forever, ex: without insert before it prints out " my Tests:::: head ->3 -> 2 -> 1 -> 4 -> ||| " But when I use insertBefore and print it out, it prints out head ->3 -> 4 -> 2 -> 1 -> 4 -> 2 -> 1 -> 4 -> 2 -> 1 -> 4 -> 2 -> 1 -> 4 -> 2 -> 1 -> 4 ->

问题 I'm trying to figure out how to clear a stack (in the form of a linked list). Linked lists aren't my forte; I don't understand them at all. Here's my code, can anyone shed some light onto why it's not working? When I try to call the method through a switch in main, it seems too get stuck in an infinite loop. void stack :: clearStack() { if (isEmpty()== true) { cout << "\nThere are no elements in the stack. \n"; } else { node *current = top; node *temp; while(current != NULL); { current = temp

问题 So, I'm trying override operator= in a linked list class I'm writing, but keep getting this weird problem for some reason. List& List::operator=(const List& copyList){ if(copyList.head != nullptr){ makeEmpty(); // clears *this from any previous nodes cout << "if statement " << endl; head = new Node; // create a new node for head head -> data = copyList.head -> data; // copy the first data of copylist Node* pnew = head; // a temp node to traverse the new linkedlist assert(head != nullptr);

问题 This question already has answers here : Why does my ArrayList contain N copies of the last item added to the list? (4 answers) Closed 5 years ago . I'am trying to learn the implementation of Linked List class in java. But every time I call the get method, I get the contents of Last Node. I'm not able to figure out why. The code is as follow, package learningLinkedLists; import java.util.LinkedList; public class LinkedLists { public static void main(String[] args) { Dummy d = new Dummy(0);