问苏北高手.
<P>dui16.查找算法 <BR> 折半查找 <BR> function binsearch(k:keytype):integer; <BR> var low,hig,mid:integer; <BR> begin <BR> low:=1;hig:=n; <BR> mid:=(low+hig) div 2; <BR> while (a.key< >k) and (low< =hig) do<BR> begin <BR> if a.key >k then hig:=mid-1 <BR> else low:=mid+1; <BR> mid:=(low+hig) div 2; <BR> end; <BR> if low >hig then mid:=0; <BR> binsearch:=mid; <BR> end; <BR> <BR> 树形查找 <BR> 二叉排序树：每个结点的值都大于其左子树任一结点的值而小于其右子树任一结点的值。 <BR> 查找 <BR> function treesrh(k:keytype):pointer; <BR> var q:pointer; <BR> begin <BR> q:=root; <BR> while (q< >nil) and (q^.key< >k) do <BR> if k< q^.key then q:=q^.left <BR> else q:=q^.right; <BR> treesrh:=q; <BR> end; </P><P><BR> </P> 虽然我不是苏北的，但是我还是想问一句：问题呢？
页:
[1]