Recursion
The smallest problem solvable to avoid an infinite loop
What is a Base Case?
A queue supports this operation to add elements to the end.
What is Enqueue?
A linked list with a Head and a Tail
What is a Double-Ended Linked List?
The topmost node in a tree is called this.
What is the Root?
The nodes with no children in a tree are called these.
What are Leaf Nodes?
This classic recursive puzzle involves moving discs between pegs with specific rules.
What is the Tower of Hanoi?
This data structure operates on a Last In, First Out (LIFO) principle.
What is a Stack?
Something that hold a piece of data and pointer(s) to other nodes
What is a Node?
This is the term for a graph where all edges have no direction.
What is an Undirected Graph?
This type of tree has each node with at most two children
What is a Binary Tree?
This recursive structure divides an array in half repeatedly to efficiently search for a value.
What is Binary Search?
What is a Circular Queue?
In a linked list, this operation requires shifting node connections but does not involve moving data.
What is Deletion?
A graph is connected if there’s this between every pair of vertices.
This tree traversal visits nodes in the order of left, root, and right.
What is In-Order Traversal?
This classic recursive sequence starts with 0 and 1 and each number is the sum of the two before it.
What is the Fibonacci Sequence?
This algorithm uses a queue to traverse a graph level by level
What is Breadth-First Search (BFS)?
This type of list connects the last node back to the first, forming a loop.
What is a Circular Linked List?
This traversal uses a stack (explicit or implicit) to explore as deep as possible.
What is Depth-First Search (DFS)?
What is (2height+1)
This technique breaks down a problem into smaller subproblems, solving each once and combining results.
What is Divide and Conquer?
A Data Structure used to reverse a Linked List.
What is a Stack?
This algorithm can be used to detect and remove a cycle in a linked list.
What is the Tortoise and Hare Algorithm?
What is the Floyd’s Cycle Detection Algorithm?
This algorithm finds a minimum spanning tree for a connected weighted graph.
What is Kruskal’s algorithm?
This algorithm finds the shortest path from a starting node to all other nodes in a weighted graph
What is Dijkstra's Algorithm?