DYNAMIC OPTIMAL BINARY SEARCH TREE

DOI10.1142/S0129054190000308MaRDI QIDQ3210893zbMATH OpenOpenAlexFDO

Authors A. P. Korah, M. R. Kaimal

Publication date 1990

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054190000308

zbMATH Keywords

binary search treedynamic treesoptimal treestree balancing

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 5237331
• Binary search trees of almost optimal height
• Optimal binary search trees
• Optimal search trees using two-way key comparisons
• Building Optimal Binary Search Trees from Sorted Values in O(N) Time

Cited in

(9)

• Almost optimal dynamic 2-3 trees
• Efficient selection on a binary tree
• The optimal binary search tree for Andersson's search algorithm
• Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching
• DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING
• Dynamic Trees with Almost-Optimal Access Cost
• scientific article; zbMATH DE number 5237331 (Why is no real title available?)
• Optimal binary search trees
• Optimal binary search trees

This page was built for publication: DYNAMIC OPTIMAL BINARY SEARCH TREE

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