rooted tree
McGraw-Hill Science & Technology Dictionary:
Top
rooted tree
(′rüd·əd ′trē)
(mathematics) A directed tree graph in which one vertex has no predecessor, and each of the remaining vertices has a unique predecessor.
Post a question - any question - to the WikiAnswers community:
Copyrights:
McGraw-Hill Science & Technology Dictionary
McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved.
Read more
Mentioned in
root vertex
(mathematics)
nonterminal vertex
(mathematics)
binary tree
(mathematics)
n-ary tree
(mathematics)
rooted ordered tree
(mathematics)
» More