递归生成逻辑树

最新推荐文章于 2024-07-26 08:00:19 发布

wfzhjg

最新推荐文章于 2024-07-26 08:00:19 发布

阅读量2.5k

点赞数

分类专栏： Java基础

本文链接：https://blog.csdn.net/u012506466/article/details/54985274

版权

Java基础专栏收录该内容

10 篇文章 0 订阅

订阅专栏

树节点的设计：

package com.zhjg.tree;

import java.util.ArrayList;
import java.util.List;

public class TreeNode {

	private String id;
	private String name;
	private String desc;
	private String pid;
	private List<TreeNode> children;
	
	
	public TreeNode() {
		super();
	}
	
	public TreeNode(String id, String name, String desc, String pid) {
		super();
		this.id = id;
		this.name = name;
		this.desc = desc;
		this.pid = pid;
		this.children = new ArrayList<TreeNode>();
	}


	public String getId() {
		return id;
	}
	public void setId(String id) {
		this.id = id;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public String getDesc() {
		return desc;
	}
	public void setDesc(String desc) {
		this.desc = desc;
	}
	public String getPid() {
		return pid;
	}
	public void setPid(String pid) {
		this.pid = pid;
	}

	public List<TreeNode> getChildren() {
		return children;
	}

	public void setChildren(List<TreeNode> children) {
		this.children = children;
	}
	
}

生成树结构的类（测试需要添加fastjson的依赖）：

package com.zhjg.tree;

import java.util.ArrayList;
import java.util.List;

import com.alibaba.fastjson.JSON;

/**
 * 从数据库中查询出所有的树节点
 * 自动将该节点数组转化为逻辑树结构
 * @author 327084
 *
 */
public class RecursiveTree {
	
	/**
	 * 自动将节点数据转化为树结构
	 * @param nodes
	 * @return
	 */
	public static String switchNodeListToTree(List<TreeNode> nodes){
		TreeNode root = getRoot(nodes);
		root = recursive(root, nodes);
		return JSON.toJSONString(root, true);
	}

	/**
	 * 递归添加子节点
	 * @param node
	 * @param nodes
	 * @return
	 */
	public static TreeNode recursive(TreeNode node, List<TreeNode> nodes){
		
		for (TreeNode treeNode : nodes) {
			if(treeNode.getPid().equals(node.getId())){//说明是所给节点的子节点
				node.getChildren().add(treeNode);
				recursive(treeNode, nodes);
			}
		}
		
		return node;
	}
	
	/**
	 * 获取根节点
	 * @param nodes
	 * @return
	 */
	public static TreeNode getRoot(List<TreeNode> nodes){
		TreeNode root = null;
		if(nodes != null && nodes.size() > 0){
			for (TreeNode treeNode : nodes) {
				if("".equals(treeNode.getPid())){
					root = treeNode;
					break;
				}
			}
		}
		return root;
	}
	
	/**
	 * 测试
	 * @param args
	 */
	public static void main(String[] args) {
		TreeNode root = new TreeNode("1", "中国", "中国", "");
		TreeNode node1 = new TreeNode("11", "北京", "北京", "1");
		TreeNode node2 = new TreeNode("12", "上海", "上海", "1");
		TreeNode node3 = new TreeNode("13", "山东", "山东", "1");
		TreeNode node4 = new TreeNode("131", "潍坊", "潍坊", "13");
		TreeNode node5 = new TreeNode("1311", "安丘", "安丘", "131");
		TreeNode node6 = new TreeNode("111", "朝阳区", "朝阳区", "11");
		List<TreeNode> nodes = new ArrayList<TreeNode>();
		nodes.add(root);
		nodes.add(node1);
		nodes.add(node2);
		nodes.add(node3);
		nodes.add(node4);
		nodes.add(node5);
		nodes.add(node6);
		System.out.println(switchNodeListToTree(nodes));
	}
}