~/writing/math-foundations-for-reasoning-models $ ls
Graphs and Computation
Child
A child is a node directly below another node in a rooted tree.
~/writing/math-foundations-for-reasoning-models $ cat topic.md
Child
Definition
A child is a node directly below another node in a rooted tree.
Example:
A
/ \
B C
B is a child of A.
C is also a child of A.
Child = direct successor in a rooted tree.
Parent And Child Are Paired Roles
If A is the parent of B, then B is a child of A.
Example:
A
`-- B
Both statements describe the same direct connection from different sides.
Parent and child describe direction in a hierarchy.
A Node Can Have Multiple Children
Example:
A
/ | \
B C D
A has three children:
B
C
D
This is how trees branch.
Children are the immediate branches from a node.
A Node Can Have No Children
Example:
A
`-- B
B has no children.
A node with no children is called a leaf.
Not every node must branch further.
Child vs Descendant
Child means one level below.
Descendant means any level below.
Example:
A
`-- B
`-- C
B is a child of A.
C is a descendant of A, but not a child of A.
Child is immediate; descendant can be deeper.
Final Summary
- A child is directly below another node in a rooted tree.
- Parent and child are paired roles.
- A node can have many children.
- A node can also have no children.
- Child means immediate successor, while descendant can be deeper.
~/writing/math-foundations-for-reasoning-models $ open
Continue the series.
Leaf