1988•The Computer JournalRequires access

Iterative Tree Traversal using Refinements and Pointer Rotation

Theo P. van der Weide

Abstract

This paper concerns the didactic use of refinements and pointer rotation in the derivation of iterative traversal algorithms according to a given specification. The concept of tree transformation provides a high-level view on (non-recursive) tree traversal. Tree transformations can be realised by using the concept of pointer rotation.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Tree traversal, Pointer (user interface), Computer science, Tree (set theory), Algorithm, Rotation (mathematics), Theoretical computer science, Transformation (genetics)