经典数据结构例子: 二叉排序树的应用-- 排序与检索.-classic example of data structure : binary sort of tree -- Sorting and Searching.

简单的分形图绘制程序 可以绘制简单的二叉树形分形图 turbo c 2.0编译-simple fractal mapping procedures can draw a simple binary tree-shaped Fractal 2.0 turbo c compiler

生成规则：以如图8-27n＝2所示二叉树为基础，以每个分支为主树干，按照比例递归出另一个二叉树，如图8-27n＝3所示。依此类推，便形成了疏密有致的分形树，称为Caley树-Generated rules: in Figure 8-27n = 2 as shown is based on binary tree to each branch of the main trunk, in accordance with the proportion of another recursive bina

详细的二叉树画法，和其他的有所不同，很有特色的。-Details of the binary tree painting, and other different, very unique.