answersLogoWhite

0

a Linked List is a Linear collection of self refrential -class objects, called Nodes that's in General. but if you are using Java You can build it Like That.. http://www.cs.fiu.edu/~weiss/dsj3/code/weiss/nonstandard/LinkedList.java if you are using C++ this Link will be helpful http://richardbowles.tripod.com/cpp/linklist/linklist.htm it covers the ideas of a linked list that what i used (C++,Java) i don know what about C# maybe other contributors can help...

User Avatar

Wiki User

17y ago

What else can I help you with?

Related Questions

How to write aC program to merge two singly linked list?

write a c program to circular queue


Write a program in C to create a Circular Linked list?

#include<iostream.h>


Write a program which reads names of students and their telephones from a file and produce a linked list ordered in alphabetical order by the surname of the student?

write a program which reads names of students and their telephones from a file and produce a linked list ordered in alphabetical order by the surname of the student.


Write a algorithm for doubly linked list in c?

sorry


Explain Pseudo code for circular linked list?

write pseudocode for link list


Convert single linked list to double linked list?

You copy a singly linked list into a doubly linked list by iterating over the singly linked list and, for each element, calling the doubly linked list insert function.


Write a Linked list program for insertion and deletion of a node using structureswitch case and in c language?

for all datastructure ,c,c++ programs just visit codingdatastructure.blogspot.com and found on blog archive..


How do you write a Java program to implement weighted queue using circular doubly linked list?

Add weights to the elements of the queue and use an algorithm to sort the queue every time an element is added.


C program to implement deque using circular linked list?

You'll need to use a doubly-linked circular list, since otherwise when you pop off the tail element you'll need to whizz all the way round the list to find its predecessor. See the links section for an implementation of a doubly-linked circular list.


Which is the easy insertion operator single linked-list or double-linked list?

It is easier to insert into a singly linked list.


How to write an actual algorithm for inserting an element in a linked list?

Insert newNode into a linked list after targetNode Node currentNode = root while currentNode != targetNode currentNode = currentNode.next newNode.next = currentNode.next currentNode.next = newNode


Write the concepts of linked list?

A simple linked list is built out of nodes. Each node consists of two sections, data and a pointer. The data contains whatever information that this node of your list needs to contain, and the pointer contains the memory address of the next node in your list.