左右值无限级分类算法
为什么要使用左右值来表示无限级分类?
一般我们会使用parent标识来表示节点之间的上下级关系,好处是结构清晰,修改起来非常方便,缺点是查询很麻烦,可能需要使用到递归查询,递归的使用将会使性能大幅度降低尤其是递归层级多的时候,有些查找,比如统计当前节点的所有子节点个数(例如:钉钉的组织架构无限级),这就必须要递归到最后一级,所以在类似于这种需要递归到最后一级才能返回结果的场景,我们就可以补充左右值来提升性能。
左右值如何表示?
Node属性和方法:
public class Node{
private int index;
private int parentIndex;
private Object value;
private int left;
private int right;
private int level;
public Node(int index,Object value){
this.index = index;
this.value = value;
this.left = defaultLeft;
this.right = defaultRight;
this.level = defaultLevel;
this.parentIndex = defaultParentIndex;
}
public Node(int index,Object value,int left,int right,int level,int parentIndex){
this.index = index;
this.value = value;
this.left = left;
this.right = right;
this.level = level;
this.parentIndex = parentIndex;
}
//省略getting、setting方法
}
index:当前节点的唯一标识
value:节点值
parentIndex:父节点唯一标识
left:左值
right:右值
level:当前层级(用于查询直接子集)
数据列表:
[
{
"index":0,
"left":1,
"level":1,
"parentIndex":-1,
"right":24,
"value":"A"
},
{
"index":1,
"left":2,
"level":2,
"parentIndex":0,
"right":11,
"value":"B"
},
{
"index":2,
"left":3,
"level":3,
"parentIndex":1,
"right":6,
"value":"C"
},
{
"index":3,
"left":4,
"level":4,
"parentIndex":2,
"right":5,
"value":"D"
},
{
"index":