定义:
1.类定义:
using System.Collections.Generic;
class nodes<T>
{
T data;
nodes<T> Lnode, Rnode, Pnode;
public T Data
{
set { data = value; }
get { return data; }
}
public nodes<T> LNode
{
set { Lnode = value; }
get { return Lnode; }
}
public nodes<T> RNode
{
set { Rnode = value; }
get { return Rnode; }
}
public nodes<T> PNode
{
set { Pnode = value; }
get { return Pnode; }
}
public nodes()
{ }
public nodes(T data)
{
this.data = data;
}
}
2.方法:
T Add<T>(T a,T b)
{
return a + b;
}
二.调用:
1.类:
- static nodes﹤string﹥ BinTree()
- {
- nodes﹤string﹥[] binTree = new nodes﹤string﹥[8];
- //创建结点
- binTree[0] = new nodes﹤string﹥("A");
- binTree[1] = new nodes﹤string﹥("B");
- binTree[2] = new nodes﹤string﹥("C");
- binTree[3] = new nodes﹤string﹥("D");
- binTree[4] = new nodes﹤string﹥("E");
- binTree[5] = new nodes﹤string﹥("F");
- binTree[6] = new nodes﹤string﹥("G");
- binTree[7] = new nodes﹤string﹥("H");
- //使用层次遍历二叉树的思想,构造一个已知的二叉树
- binTree[0].LNode = binTree[1];
- binTree[0].RNode = binTree[2];
- binTree[1].RNode = binTree[3];
- binTree[2].LNode = binTree[4];
- binTree[2].RNode = binTree[5];
- binTree[3].LNode = binTree[6];
- binTree[3].RNode = binTree[7];
- //返回二叉树的根结点
- return binTree[0];
- }
2.方法:
int a=3;
inb b=4;
int cc=Add<int>(3,4);
或
int cc=Add<int>(a,b);