Glossary

Find a term

Search for a word or select a letter. Each definition is a short reminder connected to a full lesson for examples and trade-offs.

Search the glossary

62 terms

A

Algorithm: A precise sequence of steps for solving a problem.
Array: A sequence of values with direct indexed access.
Assembly: A compiled code unit with its own dependencies and references.
Asymptotic bound: A growth bound describing resources as input size increases.
Auxiliary space: Memory beyond the supplied input, under an explicit counting convention.

B

Backtracking: Exploring a choice, then returning to try another if needed.
Balanced tree: A tree whose height is constrained by a defined balancing rule.
BFS: Breadth-first search explores vertices by increasing edge distance.
Binary search: Search on sorted indexed data by repeatedly halving the candidate range.
Binary search tree: A binary tree with ordered keys in its left and right subtrees.
Binary tree: A tree with at most one left child and one right child per node.
Branch: A movable name for a Git commit history tip.
Branch protection: Hosting rules that restrict updates or merging to important branches.
Bucket: A location used to group entries in a hash table.

C

Call stack: Storage of active function calls and their local state.
Child node: A node directly connected below a parent in a rooted tree.
CI/CD: Automation for validating, building and delivering changes.
Collision: Two distinct hash keys are assigned the same table location.
Commit: An immutable Git snapshot with parents and metadata.
Complete binary tree: All levels before the last are full; the last fills from left.

D

Default branch: Repository branch chosen as the default base for work and reviews.
DFS: Depth-first search explores one branch before returning to others.
Directed graph: A graph whose edges have directions.

E

Edge: A connection between two vertices or tree nodes.

F

Feature branch: A short-lived branch used to isolate one change.
Fetch: Download Git objects and update remote-tracking references.
FIFO: First in, first out, the rule used by a queue.
Frame: One rendered picture in a running game or application.

G

Graph: Vertices connected by edges, possibly directed or cyclic.

H

Hash function: A function used to map a key toward a table location.
HEAD: Git reference pointing to the currently checked-out commit or branch.
Height: Maximum number of edges on a downward path to a leaf, by one convention.

I

Inorder: Depth-first binary-tree order: Left, Root, Right.
Inspector: Unity editor panel used to inspect and edit component values.

L

Leaf node: A tree node with no children.
LIFO: Last in, first out, the rule used by a stack.

M

Merge: Integration of changes from different Git histories.

N

Namespace: A named scope for organizing C# types.
Node: An element of a tree or graph.

O

Origin: A conventional Git remote name, not a special Git keyword.
origin/main: A local record of the last fetched main branch tip at origin.

P

Parent node: A node with a direct child in a rooted tree.
Postorder: Depth-first binary-tree order: Left, Right, Root.
Prefab: Reusable Unity GameObject configuration with instances.
Preorder: Depth-first binary-tree order: Root, Left, Right.
Pull request: A proposal to integrate and review changes between Git branches.

Q

Queue: A structure that removes the oldest enqueued element first.

R

Rebase: Replay commits on a new base, changing their commit IDs.
Recursion: A function calling itself with a terminating condition.
Remote: A named Git location for exchanging commits.
Root node: The distinguished top node of a rooted tree, without a parent.

S

Scene: Unity asset that organizes GameObjects and components.
Shader: A GPU program or stage used in rendering graphics.
Space complexity: How memory requirements grow with input size.
Stable sort: Sorting that retains relative order of equal-key elements.
Stack: A structure that removes the newest pushed element first.
Subtree: A tree node together with all of its descendants.

T

Time complexity: How the amount of algorithmic work grows with input size.
Traversal: Visiting graph vertices or tree nodes by defined rules.

U

Upstream: Either a configured tracking branch or a named original-project remote.

V

Vertex: An individual node in a graph.

X

XML documentation: Structured C# API comments consumed by IDEs and documentation tools.

How to use this reference

Some terms have multiple meanings depending on context. The linked guide provides assumptions and detailed examples. This glossary is a navigation tool, not a substitute for the underlying explanation.