The following pages link to On binary search trees (Q2366072):
Displaying 13 items.
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- New lower bounds on the cost of binary search trees (Q1351808) (← links)
- Binary search tree recursions with harmonic toll functions (Q1612306) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- A strategy for searching with different access costs. (Q1853499) (← links)
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees (Q3183458) (← links)
- Reflections on Optimal and Nearly Optimal Binary Search Trees (Q3644717) (← links)
- Onq-trees (Q3718732) (← links)
- (Q4524567) (← links)
- (Q4865401) (← links)
- Binary search trees: How low can you go? (Q5054833) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- Optimal binary search trees (Q5906917) (← links)