Definition: Of a node, the distance from the node to the root of the tree.
Formal Definition: The depth of the root is 0. The depth of a node is one plus the depth of its parent.
Aggregate parent (I am a part of or used in ...)
See also height, level.
Note: For instance, the root has or is at depth 0, and a child of the root has or is at depth 1.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 26 May 2011.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "depth", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 26 May 2011. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/depth.html