A taxonomy of binary tree traversals
type: Item
instance of: scholarly article
title: A taxonomy of binary tree traversals
zbMATH Open document ID: 0607.68050
DOI: 10.1007/BF01933706
author: Alfs Berztiss
published in: BIT
publication date: 1986-01-01T00:00:00Z
review text: A survey of the literature shows that eleven binary tree traversals have been defined. We systematize this work by proposing a classification that consists of twenty-six traversals grouped into seven categories. Three generator schemas are provided that allow all of the traversals to be implemented.
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 3982534
zbMATH Keywords: program schema
zbMATH Keywords: data structure
MaRDI profile type: Publication
cites work: Another representation of binary tree traversal
cites work: Q4079014
cites work: Depth-first K-trees and critical path analysis
cites work: Addressless Units for Carrying Out Loop-Free Computations
cites work: Nonrecursive traversals of trees
cites work: Co-expression in Icon
cites work: Some ideas on data types in high-level languages
cites work: Q5585020
cites work: Q4057549
cites work: Q5667465
cites work: Q3935448
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Marking algorithms
full work available at URL: https://doi.org/10.1007/bf01933706
OpenAlex ID: W2100758067
description: scientific article; zbMATH DE number 3982534