1,给定表（19,14,22,01,66,21,83,27,56,13,10）.试按元素在表中的次序将它们依次插入一棵初始时为空的二叉排序树,画出插入完成之后的二叉排序树.2,给定有序表D={006,087,155,188,220,465,505,508,511,586,656,67

Question

1,给定表（19,14,22,01,66,21,83,27,56,13,10）.
试按元素在表中的次序将它们依次插入一棵初始时为空的二叉排序树,画出插入完成之后的二叉排序树.
2,给定有序表D={006,087,155,188,220,465,505,508,511,586,656,670,700,766,897,908},用二分查找法在D中查找586,试用图示法表示出查找过程.

Answer 1

01
10 13
14 19 21 22
27 56 66 83
006,087,155,188,220,465,505,508,511,586,656,670,700,766,897,908
1st min mid max
第一步定义三个指针min,max,mid
min指向D[0] max志向D[16] mid指向D[(0+16)/2] 比较586与D[mid]
若大于则min=mid mid=min+max/2
006,087,155,188,220,465,505,508,511,586,656,670,700,766,897,908
min mid max
比较586与D[mid]得小于,则max=mid mid=min+max/2
006,087,155,188,220,465,505,508,511,586,656,670,700,766,897,908
min mid max
此时得D[mid]=586 输出mid的数值,即位置值
程序通过循环和条件比较语句实现