Transcription of Introduction to Data Structures and Algorithms
{{id}} {{{paragraph}}}
Example: quiz answers
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 P
Data Structures and Algorithms(137) Typical Implementation of a Stack A typical implementation of a stack of size n is based on an array S[1…n] ⇨so it can hold at most n elements top(S) is the index of the most recently inserted element
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: