Science Fair Project Encyclopedia
Child node
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.
03-10-2013 05:06:04
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details