The Expected Performance of Traversal Algorithms in Binary Trees

DOI10.1093/comjnl/28.4.426zbMath0568.68048OpenAlexW2056975861MaRDI QIDQ3685212

Keith Brinck

Publication date: 1985

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

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

zbMATH Keywords

data structures

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Counting labels in binary trees ⋮ A new representation of binary search trees

This page was built for publication: The Expected Performance of Traversal Algorithms in Binary Trees