The Expected Performance of Traversal Algorithms in Binary Trees

DOI10.1093/COMJNL/28.4.426MaRDI QIDQ3685212zbMATH OpenOpenAlexFDO

Authors 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) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Expected Costs in Some Classes of Binary Search Trees
• A taxonomy of binary tree traversals
• An Approximation Algorithm for Binary Searching in Trees
• An approximation algorithm for binary searching in trees
• The profile of binary search trees
• Reflections on Optimal and Nearly Optimal Binary Search Trees
• scientific article; zbMATH DE number 3868632
• Optimal binary search trees
• Optimal binary search trees

Cited in

(6)

• Computing parent nodes in threaded binary trees
• A new representation of binary search 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
• The new design of the threaded binary trees
• Counting labels in binary trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685212)