end;
constructor TYuTree.Create;
begin
FFirstNode := nil;
procedure TYuTree.Delete(Node: TYuNode);
Node.Delete;
destructor TYuTree.Destroy;
Clear;
inherited;
function TYuTree.Insert(Brother: TYuNode): TYuNode;
var
Prev, Next: TYuNode;
if Brother = nil then
Result := Add(nil);
Exit;
if Brother.GetNextBrother = nil then
Result := Add(Brother)
else
Prev := Brother;
Next := Brother.GetNextBrother;
Result := TYuNode.Create(Self);
Prev.FDownRight := Result;
Next.FUpRight := Result;
Result.FUpRight := Prev;
Result.FDownRight := Next;
end.
//――――――结束―――――――――――――――――――――――――――-
上一页 [1] [2] [3] [4] [5] [6] [7] [8] [9]
Copyright @ 2007-2012 敏韬网(敏而好学,文韬武略--MinTao.Net)(学习笔记) Inc All Rights Reserved. 闵涛 E_mail:admin@mintao.net(欢迎提供学习资源)
鄂公网安备 42011102001154号
站长:MinTao ICP备案号:鄂ICP备11006601号-18