1. Lecture No.03 Data Structures Dr. Sohail Aslam

2. Linked List Actual picture in memory: head 2 6 8 7 1 current 1051 6
1052
1063
current
1053
1063
1054 2
head
1055
1051
1056 2 6 8 7 1
1057 7
1058
1060
End of lecture 2
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.
current
1059
1060 1
1061
head
1062
1054
1063 8
1064
1057
1065

3. Linked List Operations
add(9): Create a new node in memory to hold ‘9’ Node* newNode = new Node(9); 9
newNode
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

4. 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 9
newNode 2 6 8 7 1
head
current
size=5 6 9
newNode 3
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

5. 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; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

6. 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; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

7. 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; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

8. 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; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

9. 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; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

10. 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; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

11. 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; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

12. 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; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

13. 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; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

14. 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; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

15. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

16. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

17. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

18. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

19. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

20. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

21. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

22. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

23. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

24. C++ Code for Linked List
#include <stdlib.h>
#include "Node.cpp"
class List {
public:
// Constructor
List() {
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
size = 0; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

25. 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++; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

26. 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++; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

27. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

28. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

29. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

30. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

31. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

32. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

33. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

34. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

35. 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++; }; 
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

36. 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++; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

37. 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++; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

38. 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++; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

39. 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++; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

40. 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++; };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future. 

41. Building a Linked List List list; headNode size=0
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

42. Building a Linked List List list; list.add(2); headNode size=0
currentNode
headNode 2
list.add(2);
size=1
lastcurrentNode
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

43. Building a Linked List List list; list.add(2); list.add(6); headNode
size=0
currentNode
headNode 2
list.add(2);
size=1
lastcurrentNode
currentNode
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.
list.add(6);
headNode 2 6
size=2
lastcurrentNode

44. Building a Linked List List.add(8); list.add(7); list.add(1);
currentNode
headNode 2 6 8 7 1
size=5
lastcurrentNode
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

45. C++ Code for Linked List
int get() {
if (currentNode != NULL)
return currentNode->get(); };
The first goal is a worldview to adopt
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.

46. C++ Code for Linked List
bool next() {
if (currentNode == NULL) return false;
lastCurrentNode = currentNode;
currentNode = currentNode->getNext();
if (currentNode == NULL || size == 0)
return false;
else
return true; };
End of lecture 3
The second goal is the “nuts and bolts” of the course.
The third goal prepares a student for the future.