集合根据父子节点进行排序

private List<ResAreaBean> sortParentAndChild(List<ResAreaBean> entities) {
		// 1. 寻找集合中的所有根节点
		Map<String, List<ResAreaBean>> pMap = new HashMap<String, List<ResAreaBean>>(); // 父节点为key
		Set<String> ids = new HashSet<String>(); // 存储节点id
		Set<String> pids = new HashSet<String>(); //存储父节点id
		for (ResAreaBean entity : entities) {
			ids.add(entity.getTreeCode());
			String pid = entity.getParentAreaCode();
			pids.add(pid);
			if(null == pMap.get(pid)) {
				pMap.put(pid, new ArrayList<ResAreaBean>());
			}
			pMap.get(pid).add(entity);
		}
		pids.removeAll(ids); // 得到根节点

		// [OPTIONAL] 节点id重复，退出
		if (ids.size() < entities.size()) {
			return null;
		}

		// 2. 父子排序
		List<ResAreaBean> sortedList= new ArrayList<ResAreaBean>();
		for (String rootPid : pids) {
			List<ResAreaBean> queue = pMap.remove(rootPid);
			if (null != queue) {
				while(queue.size() > 0) {
					ResAreaBean entity = queue.remove(0);
					sortedList.add(entity);
					List<ResAreaBean> tmpList = pMap.remove(entity.getTreeCode());
					if (null != tmpList) {
						queue.addAll(tmpList);
					}
				}
			}
		}
		return sortedList;
	}