lec5 - Outline ADT - Abstract Data Type and examples Stack,...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Outline ADT - Abstract Data Type and examples Stack, Queue, Priority Queue Implementations Data structure review: Binary tree, binary search tree Heap Definition Properties Tree Implementation Lecture 5, ADT and heap, p. 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
ADT — Abstract Data Type Motivation: Separate conceptual functionalities and al- gorithm implementation. Treat the data structure as a black box. Definition: [Sedgewick, pp128] An abstract data type ADT is a data type (a set of values and a collection of opera- tions on those values) that is accessed only through an interface . We refer to a pro- gram that uses an ADT as a client , and a program the specifies that data type as an implementation . Mapping to Java: Class definition Interface definition Lecture 5, ADT and heap, p. 2
Background image of page 2
ADT, Examples: Stacks and Queues Stack (Last In First Out): isEmpty(): true if the stack is empty; false oth- erwise. push(a): push the element to the top of the
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

lec5 - Outline ADT - Abstract Data Type and examples Stack,...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online