| | Child Node @ ColorfulImaginations.com (Colorful Imaginations) (Site not responding. Last check: 2007-10-22) |
 | | Nodes at the bottom most level of the tree are called leaf nodes. |
 | | There are many different ways to represent trees; common representations represent the nodes as records allocated on the heap with pointers to their children, their parents, or both, or as items in an array, with relationships between them determined by their positions in the array (e.g., binary heap). |
 | | A walk in which each parent node is traversed before its children is called a pre-order walk; a walk in which the children are traversed before their respective parents are traversed is called a post-order walk. |
| colorfulimaginations.com /encyclopedia/Child_node (686 words) |