组合模式

public class TreeNode{

private String name;

private TreeNode parent;

private Vector<TreeNode> children = new Vector<TreeNode>();

public void setName(String name){

this.name = name;

}

public void setParent(TreeNode parent){

this.parent = parent;

}

public String getName(){

return name;

}

public TreeNode getParent(){

return parent;

}

public void add(TreeNode treeNode){

children.add(treeNode);

}

public void remove(TreeNode treeNode){

children.remove(treeNode);

}

public Enumeration<TreeNode> getChildren(){

return children.elements().

}

}


public class Tree{

private TreeNode root = null;

public Tree(String name){

root = new TreeNode(name);

}


public static void main(String[] args){

Tree tree = new Tree("A");

TreeNode treenode1 = new TreeNode("B");

TreeNode treenode2 =new TreeNode("C");


treenode1.add(treenode2);

tree.root.add(treenode1);

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值