Analysis of algorithms on threaded trees

DOI10.1093/comjnl/24.2.148zbMath0456.68070OpenAlexW1982839286MaRDI QIDQ3906432

Keith Brinck, Norman Y. Foo

Publication date: 1981

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/24.2.148

zbMATH Keywords

binary treesrandom node

Mathematics Subject Classification ID

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

Related Items (9)

A First-Order Logic with Frames ⋮ Computing parent nodes in threaded binary trees ⋮ The joint distribution of the three types of nodes in uniform binary trees ⋮ A study of binary tree traversal algorithms and a tag-free threaded representation ⋮ Patterns in trees ⋮ On the inner structure of multidimensional simply generated trees ⋮ On the inner structure of multidimensional simply generated trees ⋮ Loop-free algorithms for traversing binary trees ⋮ A new representation of binary search trees

This page was built for publication: Analysis of algorithms on threaded trees