A child node or descendant node is a node in a tree data structure that is linked to by a parent node. Thinking of the tree as a directed graph, node A is a child of node B if and only if node A is a successor node of B.
A node with no child nodes is called a leaf node.
A node which is not the child of any node (i.e. has no parent) is called a root node.
