collaborators

1 paper

cs.DS2025

Greedy BST on Permutation Initial Tree

Akash Pareek

The Greedy binary search tree (BST) algorithm, like the Splay tree, is a prominent candidate for the \emph{dynamic optimality conjecture}. While Greedy satisfies many desirable pro…