树形查找二叉排序树:每个结点的值都大于其左子树任
18 查阅
参考答案:
begin
\r\n
q:=root;
while (q<>nil) and (q^.key<>k) do
if k<q^.key then q:=q^.left
else q:=q^.right;
treesrh:=q;
end;
参考答案:
begin
\r\n
q:=root;
while (q<>nil) and (q^.key<>k) do
if k<q^.key then q:=q^.left
else q:=q^.right;
treesrh:=q;
end;