code.ponfee.commons.tree

类 TreeNode<T extends Serializable & Comparable<? super T>,A extends Serializable>

java.lang.Object

code.ponfee.commons.tree.BaseNode<T,A>

code.ponfee.commons.tree.TreeNode<T,A>

类型参数:

T - the node id type

A - the attachment biz object type

所有已实现的接口:

Serializable, Cloneable

public final class TreeNode<T extends Serializable & Comparable<? super T>,A extends Serializable>
extends BaseNode<T,A>

 Tree node structure

 ┌───────────────────────────┐
 │              0            │
 │        ┌─────┴─────┐      │
 │        1           2      │
 │    ┌───┴───┐   ┌───┴───┐  │
 │    3       4   5       6  │
 │  ┌─┴─┐   ┌─┘              │
 │  7   8   9                │
 └───────────────────────────┘

 上面这棵二叉树中的遍历方式：
   DFS前序遍历：0137849256
   DFS中序遍历：7381940526
   DFS后序遍历：7839415620
   BFS广度优先：0123456789
   CFS孩子优先：0123478956         (备注：教科书上没有CFS一说，是我为方便说明描述而取名的)
 

作者:

Ponfee

另请参阅:

序列化表格

字段概要

字段

限定符和类型	字段和说明
static String	DEFAULT_ROOT_ID

从类继承的字段 code.ponfee.commons.tree.BaseNode

attach, available, childrenCount, degree, enabled, leftLeafCount, level, nid, path, pid, siblingOrder, treeDepth, treeLeafCount, treeMaxDegree, treeNodeCount

方法概要

限定符和类型	方法和说明
<E extends TreeTrait<T,A,E>> E	convert(Function<TreeNode<T,A>,E> convert)
<E extends TreeTrait<T,A,E>> E	convert(Function<TreeNode<T,A>,E> convert, boolean containsUnavailable)
List<FlatNode<T,A>>	flatBFS() 广度优先遍历BFS(Breath-First Search)
List<FlatNode<T,A>>	flatCFS() 按层级方式展开节点：兄弟节点相邻 子节点优先搜索CFS(Children-First Search) Should be invoking after mount(List) Note：为了构建复杂表头，保证左侧的叶子节点必须排在右侧叶子节点前面，此处不能用广度优先搜索策略
List<FlatNode<T,A>>	flatDFS() 深度优先搜索DFS(Depth-First Search)：使用前序遍历 Should be invoking after mount(List)
void	forEach(Consumer<TreeNode<T,A>> action) Traverses the tree
LinkedList<TreeNode<T,A>>	getChildren()
<E extends BaseNode<T,A>> TreeNode<T,A>	mount(List<E> nodes)
<E extends BaseNode<T,A>> TreeNode<T,A>	mount(List<E> list, boolean ignoreOrphan) Mount a tree
static <T extends Serializable & Comparable<? super T>,A extends Serializable> TreeNode<T,A>	of(BaseNode<T,A> node) Returns a tree node
static <T extends Serializable & Comparable<? super T>,A extends Serializable> TreeNode<T,A>	of(BaseNode<T,A> node, Comparator<? super TreeNode<T,A>> siblingNodeSort)
static <T extends Serializable & Comparable<? super T>,A extends Serializable> TreeNode<T,A>	of(BaseNode<T,A> node, Comparator<? super TreeNode<T,A>> siblingNodeSort, boolean buildPath)
String	print(Function<TreeNode<T,A>,CharSequence> nodeLabel)
String	toString()

从类继承的方法 code.ponfee.commons.tree.BaseNode

clone, copy, getAttach, getChildrenCount, getDegree, getLeftLeafCount, getLevel, getNid, getPath, getPid, getSiblingOrder, getTreeDepth, getTreeLeafCount, getTreeMaxDegree, getTreeNodeCount, isAvailable, isEnabled

从类继承的方法 java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

字段详细资料

DEFAULT_ROOT_ID

public static final String DEFAULT_ROOT_ID

另请参阅:

常量字段值

方法详细资料

of

public static <T extends Serializable & Comparable<? super T>,A extends Serializable> TreeNode<T,A> of(BaseNode<T,A> node)

Returns a tree node

参数:

node - the base node

返回:

a tree node

of

public static <T extends Serializable & Comparable<? super T>,A extends Serializable> TreeNode<T,A> of(BaseNode<T,A> node,
                                                                                                       Comparator<? super TreeNode<T,A>> siblingNodeSort)

of

public static <T extends Serializable & Comparable<? super T>,A extends Serializable> TreeNode<T,A> of(BaseNode<T,A> node,
                                                                                                       Comparator<? super TreeNode<T,A>> siblingNodeSort,
                                                                                                       boolean buildPath)

mount

public <E extends BaseNode<T,A>> TreeNode<T,A> mount(List<E> nodes)

mount

public <E extends BaseNode<T,A>> TreeNode<T,A> mount(List<E> list,
                                                     boolean ignoreOrphan)

Mount a tree

参数:

list - 子节点列表

ignoreOrphan - true忽略孤儿节点

flatDFS

public List<FlatNode<T,A>> flatDFS()

深度优先搜索DFS(Depth-First Search)：使用前序遍历

Should be invoking after mount(List)

返回:

a list nodes for DFS tree node

flatCFS

public List<FlatNode<T,A>> flatCFS()

按层级方式展开节点：兄弟节点相邻

子节点优先搜索CFS(Children-First Search)

Should be invoking after mount(List) Note：为了构建复杂表头，保证左侧的叶子节点必须排在右侧叶子节点前面，此处不能用广度优先搜索策略

返回:

a list nodes for CFS tree node

flatBFS

public List<FlatNode<T,A>> flatBFS()

广度优先遍历BFS(Breath-First Search)

返回:

a list nodes for BFS tree node

forEach

public void forEach(Consumer<TreeNode<T,A>> action)

Traverses the tree

参数:

action - the action function

convert

public <E extends TreeTrait<T,A,E>> E convert(Function<TreeNode<T,A>,E> convert)

convert

public <E extends TreeTrait<T,A,E>> E convert(Function<TreeNode<T,A>,E> convert,
                                              boolean containsUnavailable)

getChildren

public LinkedList<TreeNode<T,A>> getChildren()

print

public String print(Function<TreeNode<T,A>,CharSequence> nodeLabel)
             throws IOException

抛出:

IOException

toString

public String toString()

覆盖:

toString 在类中 Object