#include<iostream>
#include<list>
class person
{
std::string m_name;
std:string m_phone;
public:
const char* get_name()const{return( name.c_str() );}
const char* get_phone()const{return( phone.c_str() );}
person(std::string m_name, std::string m_phone) : m_name(name), m_phone(phone) {}
};
int main()
{
std::list<entry*> phonebook;
person* p = new entry("Joe Bloggs","01234 555 6789");
phonebook.push_back(p);
p = new person("Ann Other", "01234 555 9876");
phonebook.push_back(p);
p = new person("Some One", "01234 555 8769");
// and so on...
return(0);
}
pseudo code algorithm to create a linked list
mini project data structure
ok
Which of the following data structures can be randomly accessed giving loc?A. linked list implemented using arrayB. singly linked listC. double linked listD. both single and double linked listThe answer is A.
write pseudocode for link list
pseudo code algorithm to create a linked list
mini project data structure
A linked list implemented with an array defeats the purpose of using a linked list, which is to address the memory allocation problems associated with arrays.
linked list are used for creation of stack,queues to use memory in optimum manner linked list are used as they are dynamic in nature
ok
Which of the following data structures can be randomly accessed giving loc?A. linked list implemented using arrayB. singly linked listC. double linked listD. both single and double linked listThe answer is A.
write pseudocode for link list
Evaluating a Polynomial expression using a singly linked list visit : http://myfundatimemachine.blogspot.in/2012/06/polynomial-evaluation-in-c.html
Advantages of single linked list: # Decrease in storage space per linked list node # Simpler implementation Advantages of double linked list # Decrease in work when accessing a random node # Decrease in work when inserting or deleting a node
Write Code to Insert a Node in a Single Linked List at any given Position.
Yes it is possible to implement stack and queue using linked list
The Josephus problem is a problem to locate the place for the last survivour. It shows the power of the circular linked list over the singly linked lists.