Go backward to Trees and Cycles Go up to Top Go forward to Other Tree Relations |
Definition: Let T be a tree. A node y is called a child of x if there is an edge from x to y in T:
y is child of x in T: <=> <x, y> in E where E = T1.
x is then called the parent of y:
parentT(y) := such x in V: <x, y> in E where V = T0, E = T1.
Every node (apart from the root) has a unique parent.