UNIT-I: Linked Lists

1. Introduction to Data Structures

[Lecture Notes] [PPT] [Video Lecture]

2. Introduction to Linked List

[Lecture Notes] [PPT] [Video Lecture]

3.Single Linked list_insertion_deletion

[Lecture Notes] [PPT] [Video Lecture]

4.Single Linked list_additional operations

[Lecture Notes] [PPT] [Video Lecture]

5.Doubly Linked List_insertion

[Lecture Notes] [PPT] [Video Lecture]

6. Doubly Linked List_deletion

[Lecture Notes] [PPT] [Video Lecture]

7.Circular Linked list_insertion

[Lecture Notes] [PPT][Video Lecture]

8.Circular Linked list_deletion

[Lecture Notes] [PPT] [Video Lecture]

9. Polynomials with Linked List_Representation

[Lecture Notes] [PPT] [Video Lecture]

10. Polynomial operations with Linked List

[Lecture Notes] [PPT] [Video Lecture]

UNIT-II:TREES

1. Introduction to Trees

[Lecture Notes] [ppt] [Video Lecture]

2. Introduction to Binary Trees

[Lecture Notes] [PPT] [Video Lecture]

3. Binary Tree Traversals

[Lecture Notes][PPT][Video Lecture]

4.Threaded Binary Trees

[Lecture Notes] [PPT] [Video Lecture]

5. Introduction to Binary SearchSearch Trees

[Lecture Notes] [PPT] [Video Lecture]

6.Insertion and Deletion in Binary Search Tree

[Lecture Notes] [PPT][video lecture]

7.Binary Search Tree Travesals,Skewed Binary Tree

[Lecture Notes] [PPT] [Video Lecture]

8. Priority Queue

[Lecture Notes] [PPT] [Video Lecture]

9. Introduction to Binary Heap

[Lecture Notes] [PPT] [Video Lecture]

10. Binary Heap Implementation

[Lecture Notes] [PPT] [Video Lecture]

11.Heap Sort

[Lecture Notes] [PPT] [Video Lecture]