CIS 2520 Chapter Notes - Chapter 1-9: Associative Array, Linked List, Binary Tree

• School: University of Guelph
• Department: Computing and Information Science
• Course: CIS 2520
• Professor: Xining Li

Document Summary

Adt (abstract data type), a data type which can be used as a tool to complete a task. An adt will only show the relevent information to the user and hide the non-relevent implementation or how from the user. List a sequence of element with a unique predecessor or successor or neither. Used to represent linear data or anything that can be listed (ex. Linked list a dynamically changing list, using memory linked by pointers in each element of the list. Stack a linear series of elements that only allow insertion or deletion from the top (front) of the stack. Similar to a stack of lego blocks the user can only access the first element. Data structure something meant to hold data and perform certain operations on that data. Queues a list in which all insertions take place at the end (back) and deletions occur at the head (front).