PDF4PRO ⚡AMP

Modern search engine that looking for books and documents around the web

Example: barber

Introduction to Data Structures and Algorithms

Lehrstuhl Informatik 7 (Prof. Reinhard German) Martensstra e 3, 91058 ErlangenIntroduction toData Structures and AlgorithmsChapter:Elementary Data Structures (1)Data Structures and Algorithms (132)Overview on simple data Structures for representing dynamic sets of data records Main operations on these data Structures are Insertionand deletionof an element searchingfor an element finding the minimumor maximumelement finding the successoror the predecessorof an element And similar operations .. These data Structures are often implementedusing dynamically allocated objectsand pointersElementary Data StructuresData Structures and Algorithms (133)Typical Examples of Elementary Data Structures Array Stack Queue Linked List TreeElementary Data StructuresData Structures and Algorithms (134)Stack A stackimplements the LIFO (last-in, first -out) policy like a stack of plates, where you can either placean extra plate at the top or remove the topmost plate For a stack, the insert operation is called Push and the delete operation is called PopElementary Data StructuresData Structures and Algorithms (135)Where are Stacks used?

A stack implements the LIFO (last-in, first-out) policy like a stack of plates, where you can either place an extra plate at the top or remove the topmost plate For a stack, the insert operation is called Push and the delete operation is called Pop Elementary Data Structures

Loading..

Tags:

  First, Salt, Foil, First out, Last in

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Spam in document Broken preview Other abuse

Transcription of Introduction to Data Structures and Algorithms

Related search queries