📝 Mid-Term Lab Exam

DSA Lab Prep.

Every data structure, every algorithm, every code example — using class, not struct. Ready for tomorrow.

Functions that call themselves to solve sub-problems

Linear data structure with nodes pointing to next

Linked list where last node points back to head

LIFO structure with push, pop, peek operations

FIFO structure with enqueue, dequeue operations

Swapping nodes by changing links, not data

All formulas, patterns, and differences in one place

Remember: class not struct