Lecture Notes || SNS Courseware

Subject Details

Dept : IT

Sem : 3

Regul : R2023

Faculty : Ms.S.Rajasulochana

phone : NIL

E-mail : sulochana.s.cse@snsct.org

596

Page views

Files

Videos

R.Links

Lecture Notes

UNIT 1:

Linked list implementation

Singly Linked List

Abstract Data Types (ADTs)

List ADT

Array-based implementation

Circular Linked List

Doubly Linked list

UNIT 2:

Stack ADT and its array implementation

Balancing symbols

Function Calls

Linked list implementation of stack operations

Infix to Postfix conversion

Queue ADT and its array implementation

circular queue

UNIT 3:

Tree ADT

Tree Traversals

Binary Heap.

AVL Trees

Trees, Binary tree and binary search tree

Lecture Notes