Arrays & Lists
A fixed-size collection of elements of the same type
What is an array?
Last-In, First-Out data structure
What is a stack?
Hierarchical structure with parent-child relationships
What is a tree?
A set of nodes connected by edges
What is a graph?
This notation expresses upper bound complexity
What is Big-O notation?
A dynamic collection that allows insertions and deletions
What is a list?
First-In, First-Out data structure
What is a queue?
Tree where each node has at most two children
What is a binary tree?
Graph where edges have no direction
What is an undirected graph?
Used to divide problems into smaller sub-problems
What is divide and conquer?
Traversal of a collection from first to last
What is iteration?
Operation to add an element to a stack
What is push?
Traversal method: Left, Root, Right
What is in-order traversal?
Search method using a queue
What is breadth-first search?
An algorithm that uses recursion and memoization
What is dynamic programming?
Used to insert a new node in a linked list
What is a pointer/reference?
Removing an element from a queue
What is dequeue?
The longest path from root to a leaf
What is the height of the tree?
A graph with no cycles
What is an acyclic graph?
When input size doubles, time increases exponentially
What is exponential time?
Access time complexity for an element in an array
What is O(1)?
This method checks if a stack is empty
What is isEmpty?
A tree with the minimum number of nodes required for height h
What is a balanced tree?
Algorithm to find shortest paths from a source
What is Dijkstra’s algorithm?
Best time complexity for binary search
What is O(log n)?