What is a tree?
A tree is a connected, acyclic undirected graph.
Study 10 Trees and Graph Algorithms with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is a tree?
A tree is a connected, acyclic undirected graph.
How many edges does a tree with n vertices have?
A tree with n vertices has exactly n−1 edges.
What is a leaf in a tree?
A leaf is a vertex of degree 1. Every tree with at least two vertices has at least two leaves.
What is a spanning tree?
A spanning tree contains every vertex of the graph and is itself a tree.
How does Kruskal's algorithm build an MST?
Kruskal's algorithm sorts edges by increasing weight and adds an edge when it joins two previously disconnected components.
How does Prim's algorithm build an MST?
Prim's algorithm starts with one vertex and repeatedly adds the minimum-weight edge connecting the current tree to a vertex outside it.
In a rooted tree, what is a vertex's parent?
The parent of a vertex is the next vertex on its path toward the root.
What is the height of a rooted tree?
The height of a rooted tree is the maximum depth of any vertex.
What data structure does BFS use, and how does it explore?
BFS uses a queue and visits vertices level by level.
How does DFS explore a graph?
DFS follows one branch as far as possible before backtracking; it can use recursion or an explicit stack.
What is inorder traversal for a binary tree?
Inorder traversal processes the left subtree, then the vertex, then the right subtree.
What is the adjacency-list runtime of BFS and DFS?
For adjacency lists, BFS and DFS run in O(∣V∣+∣E∣) time.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A progressive guide to solving linear equations, rearranging formulas, using proportions and percents, and modeling everyday applications with equations.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A medium-difficulty quiz on double and triple integrals, including regions of integration, applications, density, average value, moments, and integral setup.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to defining sequences, evaluating their limits, and proving convergence or divergence using limit laws, bounds, monotonicity, the Squeeze Theorem, and recursive methods.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A 14-question assessment on power series, convergence, term-by-term operations, Taylor and Maclaurin series, polynomial approximation, and error bounds. The questions progress from foundational interpretation to applied convergence and approximation problems.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A structured guide to simplifying rational expressions, solving rational equations, analyzing rational functions, graphing their key features, and applying them to rates, work, and cost models.
A connected guide to modeling geometry, motion, mass, fields, work, flux, and optimization with the main tools of multivariable calculus.