THREADING FOR ENDORDER TRAVERSAL.

Abstract

Several approaches are presented to threading a tree for endorder traversal. These approaches use additional fields in each node of the tree, additional nodes, or a more typical threading philosophy but requiring additional processing to locate the thread associated with a node. For each approach, a traversal algorithm is given. For the latter approach, a proof of the algorithm is developed. All algorithms are analyzed in terms of number of executions of each step and in terms of running time for an IBM 360/50 implementation. The approaches are compared with respect to space, time, and generality. (Author)

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1970
Accession Number
AD0709231

Entities

People

  • Fred M. Tonge

Organizations

  • University of HawaiĘ»i System

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Philosophy

Fields of Study

  • Computer science

Readers

  • Artificial Intelligence
  • Computer Science.
  • Manufacturing Engineering.

Technology Areas

  • Space
  • Space - Spacecraft Maneuvers