Tree

  • Authors:

  • Peter Wegner;Edwin D. Reilly

  • Affiliations:

  • -;-

  • Venue:
  • Encyclopedia of Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A tree, or more precisely a rooted tree, is a special form of directed graph with the following properties: (1) either it has no vertices or it has a distinguished vertex called the root, which has no predecessors; and (2) every vertex other than the root has a unique predecessor.