Review 1 Polish Notation Prefix Infix Postfix Precedence of Operators Converting Infix to Postfix Evaluating Postfix
Polish Notation 2 Converting Infix to Postfix Converting Postfix to Infix Converting Infix to Prefix Examples
3 Converting Infix to Postfix
Examples 4 Converting Infix to Postfix
Examples 5 Converting Infix to Postfix
Examples 6 Converting Postfix to Infix
Examples 7 Converting Postfix to Infix
Examples 8 Converting Infix to Prefix
Examples 9 Converting Infix to Prefix
Summary 10 Converting Infix to Postfix Converting Postfix to Infix Converting Infix to Prefix Examples
Review 11 Polish Notation Prefix Infix Postfix Precedence of Operators Converting Infix to Postfix Evaluating Postfix
Polish Notation 12 Converting Infix to Postfix Converting Postfix to Infix Converting Infix to Prefix Examples
Linked Lists Introduction Insertion Description Deletion Description Basic Node Implementation Conclusion
Outline Introduction Insertion Description Deletion Description Basic Node Implementation Conclusion
Introduction Definitions Lists and arrays Nodes and pointers Single Linked Lists Double Linked Lists Circular Lists Advantages
Introduction Definitions Lists and arrays Nodes and pointers Single Linked Lists Double Linked Lists Circular Lists Advantages
Lists and arrays Lists:
Lists and arrays Arrays: {Size of the following array is = 4} Index0123 Value445963
Introduction Definitions Lists and arrays Nodes and pointers Single Linked Lists Double Linked Lists Circular Lists Advantages
Nodes and pointers
Introduction Definitions Lists and arrays Nodes and pointers Single Linked Lists Double Linked Lists Circular Lists Advantages
Single linked lists
Introduction Definitions Lists and arrays Nodes and pointers Single Linked Lists Double Linked Lists Circular Lists Advantages
Double Linked Lists
Introduction Definitions Lists and arrays Nodes and pointers Single Linked Lists Double Linked Lists Circular Lists Advantages
Circular Lists
Introduction Definitions Lists and arrays Nodes and pointers Single Linked Lists Double Linked Lists Circular Lists Advantages
The Linked List advantages are collected because of the array disadvantages, array disadvantages are: 1. Array Size 2. Memory allocation 3. Insertion and Deletion
Outline Introduction Insertion Description Deletion Description Basic Node Implementation Conclusion
Insertion Description Insertion at the top of the list Insertion at the end of the list Insertion in the middle of the list
Insertion Description Insertion at the top of the list Insertion at the end of the list Insertion in the middle of the list
Insertion at the top Steps: Create a Node Set the node data Values Connect the pointers
Insertion Description Follow the previous steps and we get head // head 93 Step 1 Step 2 Step 3
Insertion Description Insertion at the top of the list Insertion at the end of the list Insertion in the middle of the list
Insertion at the end Steps: Create a Node Set the node data Values Connect the pointers
Insertion Description Follow the previous steps and we get head // Step 1 Step 2 Step 3
Insertion Description Insertion at the top of the list Insertion at the end of the list Insertion in the middle of the list
Insertion in the middle Steps: Create a Node Set the node data Values Break pointer connection Re-connect the pointers
Insertion Description Step 1 Step 2 Step 3 Step 4
Outline Introduction Insertion Description Deletion Description Basic Node Implementation Conclusion
Deletion Description Deleting from the top of the list Deleting from the end of the list Deleting from the middle of the list
Deletion Description Deleting from the top of the list Deleting from the end of the list Deleting from the middle of the list
Deleting from the top Steps Break the pointer connection Re-connect the nodes Delete the node
Deletion Description 417 head head head 42
Deletion Description Deleting from the top of the list Deleting from the end of the list Deleting from the middle of the list
Deleting from the end Steps Break the pointer connection Set previous node pointer to NULL Delete the node
Deletion Description 417 head head head
Deletion Description Deleting from the top of the list Deleting from the end of the list Deleting from the middle of the list
Deleting from the Middle Steps Set previous Node pointer to next node Break Node pointer connection Delete the node
Deletion Description head 417 head 42 4 head 42
Outline Introduction Insertion Description Deletion Description Basic Node Implementation Conclusion
Basic Node Implementation The following code is written in C++: Struct Node { int data; //any type of data could be another struct Node *next; //this is an important piece of code “pointer” };
Summary Introduction Insertion Description Deletion Description Basic Node Implementation Conclusion