A taxonomy of binary tree traversals

DOI10.1007/BF01933706zbMath0607.68050OpenAlexW2100758067MaRDI QIDQ1085614

Alfs Berztiss

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933706

zbMATH Keywords

data structureprogram schema

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (4)

A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ ⋮ A unified approach to parallel depth-first traversals of general trees ⋮ Breadth-first traversal of trees and integer sorting in parallel ⋮ Optimal binary search trees

Cites Work

• Depth-first K-trees and critical path analysis
• Another representation of binary tree traversal
• Co-expression in Icon
• Nonrecursive traversals of trees
• Some ideas on data types in high-level languages
• Addressless Units for Carrying Out Loop-Free Computations
• Depth-First Search and Linear Graph Algorithms
• Marking algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A taxonomy of binary tree traversals