A Best Possible Bound for the Weighted Path Length of Binary Search Trees - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Kurt Mehlhorn. A Best Possible Bound for the Weighted Path Length of Binary Search Trees. SIAM Journal on Computing, 6(2):235-239, 1977.

@article{Mehlhorn77-0,
  title = {A Best Possible Bound for the Weighted Path Length of Binary Search Trees},
  author = {Kurt Mehlhorn},
  year = {1977},
  tags = {search},
  researchr = {https://researchr.org/publication/Mehlhorn77-0},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {6},
  number = {2},
  pages = {235-239},
}

runs on WebDSL