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

DOI10.1007/978-3-540-39993-3_17zbMath1278.68083OpenAlexW1552012135MaRDI QIDQ5390280

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

data structuresbinary search treebalanced tree

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

The forgiving graph: a distributed data structure for low stretch under adversarial attack

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