Data Structures Review

Flashcards summarizing key vocabulary and definitions related to data structures including stacks, queues, linked lists, and binary trees.

Abstract Data Type

A collection of data and a set of operations on that data.

Stack

A list operating on the Last In First Out (LIFO) principle, where the last item added is the first to be removed.

Push Operation

The operation that adds an item to the stack.

Pop Operation

The operation that removes the item from the top of the stack.

Queue

A list operating on the First In First Out (FIFO) principle, where the first item added is the first to be removed.

Enqueue

The operation that adds an item to the end of the queue.

Dequeue

The operation that removes an item from the front of the queue.

Linked List

A data structure where each item is linked to the next one using pointers.

Binary Tree

A type of data structure where each node has at most two children; nodes are organized in a hierarchical structure.

Inorder Traversal

A method of visiting nodes in a binary tree: LEFT, ROOT, RIGHT.

Preorder Traversal

A method of visiting nodes in a binary tree: ROOT, LEFT, RIGHT.

Postorder Traversal

A method of visiting nodes in a binary tree: LEFT, RIGHT, ROOT.