Algorithms and Data Structures Representing Sequences by Arrays and Linked Lists

Introduction Sequences Representation – Arrays – use index to identify each element – Linked lists – identify by relation to some known element Applications of sequences 2

Linked list Singly linked list Doubly linked list 3

Basic operations on Linked lists isEmpty Delete Insert Find Size maintenance 4

Implementations of Linked list Class – List – Node Methods – Basic operations 5

Arrays Bounded and unbounded arrays Basic operations – Insert – Delete – Find – Copy – Size change implementations 6

Stacks and Queues Characteristics Basic operations – push, pop, peek, isEmpty, isFull – enqueue, dequeue, isEmpty, isFull Implementations using arrays or linked lists Applications – Infix to postfix – Postfix evaluation 7

อ้างอิง Kurt Mehlhorn and Peter Sanders, Algorithms and Data Structures: The Basic Toolbox, Springer Robert Lafore, Data Structures & Algorithms in JAVA, SAMS,