IB Computer Science 5.1 Abstract Data Structures Key Definitions

A node that is directly connected and one level below another node.

A way of organising and storing data so that it can be used efficiently in algorithms and programs.

The process of identifying and fixing errors or bugs in the code

Data structures that can grow or shrink during program execution.

Connection between two nodes.

First-In, First-Out principle.

Last-in, First-out principle.

A basic unit containing data and one or more pointers.

A node that has one or more children.

A reference to another node.

Process when function calls itself within its own definition/body.

The topmost node of the tree.

Data structures whose size is fixed at compile time.

The portion of the tree rooted at a particular node, consisting of that node together with all of its descendant nodes and the edges connecting them.

The process of visiting each node in a tree data structure in a specific order.

A data structure that organizes data in a grid-like format. It consists of rows and columns, allowing you to store and access data using two indices.