Bifalgorithm post · Brisk · Chapter 1
What does it mean for nodes to be on the same level?
What does it mean for nodes to be on the same level? (Brisk · Chapter 1) — "All the nodes with the same depth are considered on the same “level.” B and F are o…
Ideas in this flowchart
- Nodes are organized into levels according to their depth in the hierarchy.
- Nodes with the same depth belong to the same level.
- In the example, B and F are on level 1, while D and E are on level 3.
- Nodes on the same level are not necessarily siblings.
- If F had a child named G, G and C would both be on level 2.
- G and C would not be siblings because they would have different parents.
- Nodes with the same level but different parents may be called cousins.
