Data structure and algorithm (C # implementation) Series---generalized tree (i)

Data | structure and algorithm (C # implementation) Series---generalized tree (i)

Heavenkiller (original)

The main difference between a generalized tree and a basic tree is that it has arbitrary degrees.





Using System;

Using System.Collections;



Namespace Datastructure

{

<summary>

Summary description of the generaltree.

which has a arbitrary degree and no empty tree

Use ArrayList to replace Listaslinkedlist

</summary>

public class Generaltree:tree

{

protected object Key=null;

protected UINT degree=0;

protected UINT height=0;



Protected ArrayList treelist=new ArrayList ();



Public Generaltree (Object _objkey)

{

//

TODO: Add constructor logic here

//



Key=_objkey;

degree=0;

height=0;

ArrayList treelist=new ArrayList ();

}



public virtual void Attacksubtree (Generaltree _gtree)

{

THIS.TREELIST.ADD (_gtree);

++degree;

}

Public virtual Generaltree Detachsubtree (Generaltree _gtree)

{



This.treeList.Remove (_gtree);

degree--;



return _gtree;//????? How to remove, reference or object????

}



public override tree This[uint _index]

{

Get

{

if (_index>=this.degree)

throw new Exception ("My:out of Index");

return (tree) treelist[(int) _index];

}

Set

{

treelist[(int) _index]=value;

}

}