关于有序二叉树高度的一个结论

A RESULT ABOUT THE HEIGHT OF ORDER BINARY-TREE

有序二叉树结构是一种常用的设计数据结构，它在排序、查找等算法中起着非常重要的作用。它的高度直接影响算法的效率。本文用组合数学、概率的方法给出了一个由Ｎ个数据所能构成的深度为ｋ的二叉树的数目的递推公式及证明。

Order binarytree is a very useful data structure,and it takes an important role in classing and searching. Its hight influnces the effection of an algorithm.This paper gaves a recursion formula about the number of order binarytrees, whose hight is k,and which is made of N data and its proof.