打印本文 打印本文 关闭窗口 关闭窗口
自己编写树(Tree)的封装类
作者:武汉SEO闵涛  文章来源:敏韬网  点击数4966  更新时间:2009/4/23 18:34:19  文章录入:mintao  责任编辑:mintao

  TYuNode = class(TObject)

  private

    //Self.Tree中除Root外, FUpLeft, FUpRight有且只有一个为空 

    FUpLeft: TYuNode;     //Self.FUpLeft.FDownLeft = Self (该指针指向的结点是该结点的父结点)

    FUpRight: TYuNode;    //Self.FUpRight.FDownRight = Self (该指针指向的结点是该结点的上一个兄弟)

 

    FDownLeft: TYuNode;   //二叉树的左指针,表树的子结点

    FDownRight: TYuNode;  //二叉树的右指针,表示树的下一个兄弟

    FOwner: TYuTree;

 

    //结点的状态信息

    FDeleting: Boolean;

    FIsRootOfDeleted: Boolean;

 

    function GetLevel(): Integer;

    function GetParent(): TYuNode;

 

    procedure CutFromTree();

 

  protected

    constructor Create(AOwner: TYuTree);

  public

    //Property Data: Pointer read FData write FData;

    Data: Pointer;

 

    //以下四个函数是基础函数,不调用其它函数,独立完成指定功能

    function GetNextBrother(): TYuNode;

    function GetPrevBrother(): TYuNode;

    function GetFirstChild(): TYuNode;

    function GetLastChild(): TYuNode;

 

    function GetNext: TYuNode;

    function GetPrev: TYuNode;

    function GetFirstBrother(): TYuNode;

    function GetLastBrother(): TYuNode;

 

    procedure MoveTo(Destination: TYuNode; Mode: TYuNodeAttachMode);

    procedure Delete();   

 

    property Level: Integer read GetLevel;

    property Parent: TYuNode read GetParent;

 

    destructor Destroy();override;

  end;

 

  TYuTree = class(TObject)

  private

    FFirstNode: TYuNode;

  public

    function Add(Brother: TYuNode):TYuNode;

    function AddFirst(Brother: TYuNode):TYuNode;

    function AddChild(Parent: TYuNode):TYuNode;

    function AddChildFirst(Parent: TYuNode):TYuNode;

    function Insert(Brother: TYuNode):TYuNode;

 

    procedure Clear();

    procedure Delete(Node: TYuNode);

 

    property FirstNode: TYuNode read FFirstNode;

 

    constructor Create();

    destructor Destroy();override;   

  end;

 

implementation

 

uses SysUtils, Math;

 

{ TYuNode }

 

constructor TYuNode.Create(AOwner: TYuTree);

begin

上一页  [1] [2] [3] [4] [5] [6] [7] [8] [9]  下一页

打印本文 打印本文 关闭窗口 关闭窗口