树节点TreeNode
- static final int MAX_SIZE = 26; // 最大孩子指针数(针对全小写的单词)
- char data; // 每个节点存储一个字符
- TreeNode[] childs; // 指向孩子节点的指针数组
- boolean isEnd; // 单词结束标志
TireTree结构和实现快速查找的原理
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
class TreeNode{
static final int MAX_SIZE = 26;
char data;
TreeNode[] childs;
boolean isEnd;
public TreeNode(){
this.childs = new TreeNode[MAX_SIZE];
this.isEnd = false;
}
public TreeNode(char ch){
this.data = ch;
this.childs = new TreeNode[MAX_SIZE];
this.isEnd = false;
}
}
// 字典树
public class TireTree {
// 在字典树中创建词子树
public void createTireTree(TreeNode node