On Finding the Height of a Binary Search Tree

DOI10.1093/COMJNL/36.3.280zbMATH Open0770.68077OpenAlexW2117638371MaRDI QIDQ4039037

Author name not available (Why is that?)

Publication date: 8 August 1993

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

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

zbMATH Keywords

worst case running timeaverage case running timeheight of a binary search treetraversals of binary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (3)

Binary search trees: How low can you go? ⋮ A note on the height of binary search trees ⋮ Title not available (Why is that?)

This page was built for publication: On Finding the Height of a Binary Search Tree

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