Lecture No.03 Data Structures Dr. Sohail Aslam
Data structures cs301 power point slides lecture 03
Dec 20, 2014
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
Lecture No.03
Data Structures
Dr. Sohail Aslam
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
1065
Linked List Operations add(9): Create a new node in memory to hold ‘9’
Node* newNode = new Node(9);
9newNode
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
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;
};
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;
};
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;
};
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;
};
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;
};
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;
};
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;
};
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;
};
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;
};
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;
};
#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
#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
#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
#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
#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
#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
#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
#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
#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
#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
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
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++; };
Building a Linked List
headNode size=0List list;
Building a Linked List
headNode
2headNode
currentNode
size=1
lastcurrentNode
size=0List list;
list.add(2);
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);
Building a Linked List
List.add(8); list.add(7); list.add(1);
2 6 7 1headNode
currentNode
size=5
lastcurrentNode
8
C++ Code for Linked List
int get() { if (currentNode != NULL) return currentNode->get();
};
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;};
Related Documents
![CS301 - Algorithms Fall 2006-2007 Hüsnü Yenigün. CS301 – Algorithms [ Fall 2006-2007 ] 2 Contents About the course Introduction What is an algorithm?](https://static.cupdf.com/doc/110x72/56649e9f5503460f94ba1a96/cs301-algorithms-fall-2006-2007-huesnue-yeniguen-cs301-algorithms-.jpg)
