Data Structures

A data structure for sorting an ordered set of data of the same data type within a single identifier

A data structure that stores data in elements called fields, organized on attributes.

A tree where each node can only have 2 children . The right node and its children always have a greater value than the root node

A data structure for storing an immutable set of data that can be of different data types within a single identifier

The first data item

Something that cannot be changed once created

A method of traversing an entire graph by visiting all the neighbours of the first node before repeating the same with each neighbour in the order they were visited

A method of traversing an entire graph by travelling as far as possible along one route before back tracking and trying alternative unexplored routes

A graph where the order of vertices paired in an edge matter. The edges are one way

A data structure consisting of a set of vertices/nodes connected by a set of edges/arcs

A data structure where a hashing algorithm calculates a value to determine where a data item is to be stored. The data item can be directly accessed by recalculation, without any search

A data structure that stores a sequence of data values, each with a unique index

A data structure where each node consists of data and pointer. The pointer gives the location of the next node

A first in first out (FIFO) data structure. The first item added/ pushed is the first to be removed/popped off

A last in first out data structure. (LIFO). The last item added/ pushed is the first to be removed/popped off

A data structure that uses a set of linked nodes to form a hierarchical structure starting at the root node. Each node is a child/sub node of a parent node

A graph where the order of get vertices paired in an edge does not matter. The edges are bidirectional