Java tree递归

public List<TreeNode> getMenu(long id){
	List<TreeNode> treeNodes = new ArrayList<TreeNode>();
	
	 List<SysMenu> list = sysMenuService.queryByParentId(id);
	 Iterator<SysMenu> iterator = list.iterator();
	 while(iterator.hasNext()){
		 SysMenu sysMenu = iterator.next();
		 TreeNode tn1 = new TreeNode();
		 tn1.setId(sysMenu.getId());
		 tn1.setText(sysMenu.getText());
		 tn1.setLeaf(tn1.getLeaf());
		 tn1.setUrl(sysMenu.getUrl());
		 TreeNode tn2 = getChildren(tn1);
		 treeNodes.add(tn2);
	 }
	return treeNodes;
}

public TreeNode getChildren(TreeNode node){
	List<TreeNode> treeNodes = new ArrayList<TreeNode>();
	TreeNode treeNode = new TreeNode();
	treeNode.setId(node.getId());
	treeNode.setIcon(node.getIcon());
	treeNode.setUrl(node.getUrl());
	treeNode.setText(node.getText());
	List<SysMenu> childList = sysMenuService.queryByParentId(node.getId());
	Iterator<SysMenu> iterator = childList.iterator();
	while (iterator.hasNext()) {
		SysMenu sysMenu = iterator.next();
		TreeNode tn1 = new TreeNode();
		tn1.setId(sysMenu.getId());
		tn1.setText(sysMenu.getText());
		tn1.setUrl(sysMenu.getUrl());
		tn1.setLeaf(tn1.getLeaf());
		TreeNode tn2 = getChildren(tn1);
		treeNodes.add(tn2);
	}
	treeNode.setChildren(treeNodes);
	return treeNode;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值