说明：  自己开发的可扩展java树结构，包括节点排序，遍历（非递归算法），查找（单节点，全路径匹配），添加删除等。排序方式，节点匹配方式均可通过接口可扩展，本代码是自己开发的一个cms项目中的一部分，可独立使用
(Self-developed scalable java tree structure, including nodes sorting, traversal (non-recursive algorithm), find (single node, the full path to match), add or delete. Sort by the node matching method can be extended through the interface that this code is its own development projects as part of a cms can be used independently)