Building Optimal Binary Search Trees from Sorted Values in O(N) Time

DOI10.1007/978-3-540-39993-3_17MaRDI QIDQ5390280zbMATH OpenOpenAlexFDO

Authors Jean Vaucher

Publication date 1 April 2011

Published in From Object-Orientation to Formal Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-39993-3_17

zbMATH Keywords

balanced treebinary search treedata structures

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Constructing optimal search trees in optimal time
• Optimal binary search trees
• Optimal binary search trees
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• Assembling approximately optimal binary search trees efficiently using arithmetics
• On a sublinear time parallel construction of optimal binary search trees
• Reflections on Optimal and Nearly Optimal Binary Search Trees
• Construction of a tree from its traversals in optimal time and space
• Constructing a binary tree efficiently from its traversals

Cited in

(10)

• Minimax trees in linear time with applications
• The forgiving graph: a distributed data structure for low stretch under adversarial attack
• DYNAMIC OPTIMAL BINARY SEARCH TREE
• Height Restricted Optimal Binary Trees
• FUNCTIONAL PEARL On building trees with minimum height
• Constructing a binary tree efficiently from its traversals
• scientific article; zbMATH DE number 2087827 (Why is no real title available?)
• A new algorithm for the construction of optimal B-trees
• On a sublinear time parallel construction of optimal binary search trees
• Algorithms and Computation

This page was built for publication: Building Optimal Binary Search Trees from Sorted Values in O(N) Time

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