About this document
Big-O Analysis of Data Structure Operations by Nirmal Mohan is a document available to read on EtoBox.
This document provides an overview of stacks, queues, and linked lists as basic data structures. It discusses implementing stacks and queues using arrays, with push/pop and enqueue/dequeue operations running in O(1) time. Linked lists are also covered, with search, insert, and delete operations running in O(n), O(1), and O(1) time respectively. The key advantages of linked lists over arrays are flexibility in size and constant-time insertion/deletion.
- Author
- Nirmal Mohan
- Language
- EN