Traversing binary trees simply and cheaply

DOI10.1016/0020-0190(79)90068-1zbMath0422.68028OpenAlexW2027952317WikidataQ29543964 ScholiaQ29543964MaRDI QIDQ1133898

Joseph M. Morris

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90068-1

zbMATH Keywords

binary treestree traversal

Mathematics Subject Classification ID

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

Related Items (4)

Eliminating the flag in threaded binary search trees ⋮ A study of binary tree traversal algorithms and a tag-free threaded representation ⋮ Modeling rate of adaptive trait evolution using Cox-Ingersoll-Ross process: an approximate Bayesian computation approach ⋮ Loop-free algorithms for traversing binary trees

Cites Work

• Unnamed Item

This page was built for publication: Traversing binary trees simply and cheaply