Lecture Notes || SNS Courseware

UNIT 1:

Abstract Data Types (ADTs)

List ADT

Array-based implementation

Linked list implementation

Singly linked lists

Circularly linked lists

Doubly-linked lists

UNIT 2:

Stack ADT

Applications - Balancing symbols

Linked list implementation of stack

Evaluating Arithmetic expressions

Function calls

Queue ADT

Circular Queue

UNIT 3:

Trees ADT

Tree Traversal

Binary Heap

Binary tree ADT

Binary Search Tree

AVL Tree

Lecture Notes