Tree
One word, taught differently in 3 fields. Each use is given apart.
In Theory & Algos
A connected and acyclic graph is called a tree.
In Systems & CS
A hierarchical data structure consisting of nodes connected by edges, growing from a root node down to leaf nodes.
In Mathematics
A graph with no loops where the rows of A are independent.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
In Theory & Algos
2Each in their own terms, from the easiest level.
Erik Demaine
A connected acyclic graph.
In Systems & CS
1In Mathematics
1Lectures that assume it
25The first 12 are shown.
- Binary Search Trees & Runway Reservation Scheduling
- Cantor Diagonalization and Metric Spaces
- SQL & Relational Databases
- Integer Models
- Static Trees
- Dynamic Graphs I
- Gibbs Measures on Infinite Trees and Homoclinic Points
- Persistent Data Structures
- Geometric Structures II
- OpenVDB: History, Motivation, and Diverse Adoption
- Continuous Gradability of R-tree Cut-Point Orders
- Forcing Axioms and Name Principles in Set Theory
Connections
38The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures29
- Graphs, Networks, Incidence Matrices
- Data Structures
- Graph Theory II: Minimum Spanning Trees
- Greedy Algorithms: Minimum Spanning Tree
- Binary Search Trees & Runway Reservation Scheduling
- Cantor Diagonalization and Metric Spaces
Show 23 moreShow fewer
- SQL & Relational Databases
- Integer Models
- Static Trees
- Dynamic Graphs I
- Gibbs Measures on Infinite Trees and Homoclinic Points
- Persistent Data Structures
- Geometric Structures II
- OpenVDB: History, Motivation, and Diverse Adoption
- Continuous Gradability of R-tree Cut-Point Orders
- Forcing Axioms and Name Principles in Set Theory
- Analysis of Multithreaded Algorithms
- Random Processes and Quasirandomness for Decomposition Problems
- Counting
- More Counting and Generating Functions
- Approximation Algorithms: Traveling Salesman Problem
- Treewidth Definitions
- Some Set Theory of Kaufmann Models
- Search: Depth-First, Hill Climbing, Beam Search
- Algebraic Circuit Complexity
- Determinacy Strength with Universally Baire Sets
- Trees and Series-Parallel Graphs
- Computer Science and Homotopy Theory
- On Wide Aronszajn Trees