Class No.03 Data Structures http://ecomputernotes .com
Computer notes - Linked List
Dec 20, 2014
Create a new node in memory to hold ‘9’. Link the new node into the list. C++ Code for Linked List
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Linked List Actual picture in memory:
1051
1052
1055
1059
1060
1061
1062
1063
1064
1056
1057
1058
1053
1054 2
6
8
7
1
1051
1063
1057
1060
0
head 1054
1063current
2 6 8 7 1
head
current
1065http://ecomputernotes.com
Linked List Operations add(9): Create a new node in memory to hold ‘9’
Node* newNode = new Node(9);
9newNode
http://ecomputernotes.com
Linked List Operations add(9): Create a new node in memory to hold ‘9’
Node* newNode = new Node(9);
Link the new node into the list
9newNode
2 6 8 7 1
head
current
size=5 6
9
newNode
1
3
2
http://ecomputernotes.com
C++ Code for Linked ListThe Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
C++ Code for Linked List
The Node class
class Node {public:
int get() { return object; };void set(int object) { this->object = object; };
Node *getNext() { return nextNode; };void setNext(Node *nextNode)
{ this->nextNode = nextNode; };private:
int object;Node *nextNode;
};
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
#include <stdlib.h>#include "Node.cpp"
class List {public:
// ConstructorList() {
headNode = new Node();headNode->setNext(NULL);currentNode = NULL;size = 0;
};
C++ Code for Linked List
http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
C++ Code for Linked List void add(int addObject) {
Node* newNode = new Node();newNode->set(addObject);if( currentNode != NULL ){
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode ); lastCurrentNode = currentNode; currentNode = newNode;
} else {
newNode->setNext(NULL); headNode->setNext(newNode); lastCurrentNode = headNode;
currentNode = newNode; } size++; }; http://ecomputernotes.com
Building a Linked List
headNode size=0List list;
http://ecomputernotes.com
Building a Linked List
headNode
2headNode
currentNode
size=1
lastcurrentNode
size=0List list;
list.add(2);
http://ecomputernotes.com
Building a Linked List
headNode
2headNode
currentNode
size=1
lastcurrentNode
2 6headNode
currentNode
size=2
lastcurrentNode
size=0List list;
list.add(2);
list.add(6);
http://ecomputernotes.com
Building a Linked List
List.add(8); list.add(7); list.add(1);
2 6 7 1headNode
currentNode
size=5
lastcurrentNode
8
http://ecomputernotes.com
C++ Code for Linked List
int get() { if (currentNode != NULL) return currentNode->get();
};
http://ecomputernotes.com
C++ Code for Linked Listbool next() {
if (currentNode == NULL) return false;
lastCurrentNode = currentNode;currentNode = currentNode->getNext();if (currentNode == NULL || size == 0)
return false;else
return true;};
http://ecomputernotes.com
Related Documents
![Commodity Linked Notes - SEC...Commodity Linked Notes $_____ Commodity Linked Notes, due April [25], 2013, Linked to WTI Crude Oil • The notes are our unsecured senior notes. •](https://static.cupdf.com/doc/110x72/5fc0f565d9f0811cab76ba31/commodity-linked-notes-sec-commodity-linked-notes-commodity-linked.jpg)
