Math 2.0

Combinatorics Concept

Rooted tree

Summary

A rooted tree is a tree with a chosen vertex, the root, which gives each edge a direction away from it. Rooted trees model hierarchies and recursive data. The node rooted tree gives the precise definition.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Tree_(graph_theory), Rooted tree
About this page
Tag0Y0JGC2K9T
URIm2://0Y0JGC2K9T
Kindconcept
WritingW1 stated
MSC05C05
SpecializesTree

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions

Special cases

Used by