Sign inSign in
ConceptTheory & AlgosSystems & CS1 more

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

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    A connected acyclic graph.
    • 1:46Greedy Algorithms: Minimum Spanning Tree

In Systems & CS

1

    In Mathematics

    1

      Lectures that assume it

      25

      The first 12 are shown.

      Connections

      38

      The lectures that define it or assume it, and the concepts next to it.

      Concepts9

      Show 3 more

      Lectures29

      Show 23 more

      4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.