员工管理-遍历（递归）

搜索某个节点一下的所有某个名字的子节点

写了个递归

<pre name="code" class="java"><span style="font-family: Monaco;">	private List<User> getAllChildren(String tel) {</span>

		List allChildren = new ArrayList();
		List temp = findChildren(tel);//获得某人的所有直属下级
		if (temp.size() == 0) {
			return allChildren;
		}

		for (int i = 0; i < temp.size(); i++) {
			allChildren.add((User) temp.get(i));
			allChildren.addAll(getAllChildren(((User) temp.get(i)).getTel()));
		}
		return allChildren;
	}

	public List<User> searchByUsername(String username, String usertel) {
		List list = new ArrayList();
		List allChildren = getAllChildren(usertel);
		for (int i = 0; i < allChildren.size(); i++) {
			if (((User) allChildren.get(i)).getUsername().equals(username)) {
				list.add((User) allChildren.get(i));
			}
		}
		return list;
	}