Login / Signup

An efficient upper bound of the rotation distance of binary trees.

Jean Marcel Pallo
Published in: Inf. Process. Lett. (2000)
Keyphrases
  • upper bound
  • binary trees
  • lower bound
  • worst case
  • series parallel
  • distance measure
  • euclidean distance
  • branch and bound
  • binary tree
  • hash tables
  • knowledge base
  • decision trees