Data Structure - trees and queues - Notes, Study notes for Data Structure. Indian Institute of Information Technology (IIIT)

Data Structure

Description: This document about Data and File Structures , Queue, Queue Implementations, Circular Queue, Graph: Definition, Representing Graphs.
Showing pages  1  -  2  of  32
Data and File Structures
Queue
Properties
Elements removed in order of insertion
First-in, First-out (FIFO)
Must track Front (first in) and Back (last in)
Queue operations
Enqueue = add element (to back)
Dequeue = remove element (from front)
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Uploaded by: visir66
Views: 1581
Downloads : 0
University: Indian Institute of Information Technology (IIIT)
Upload date: 01/09/2011
Embed this document:
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome