Bruno O. Shubert

Learn More
A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally . A generating function for the number of nodes given(More)
  • 1