三叉搜索树

currentNode.eqNode=newTSTNode(key.charAt
(charIndex));
}
currentNodecurrentNode=currentNode.eqNode;
}elseif(charComp<0){//小于
if(currentNode.loNode==null){
currentNode.loNode=newTSTNode(key.charAt
map.put("tkey" + i, "value" + i);
tree.addWord("tkey" + i);
}
System.out.println("search:");
Iterator<String> it = map.keySet().iterator();
while (it.hasNext()) {
char c = key.charAt(i);
if (diff == 0) {//当前单词和上一次的相比较，如果相同
i++;
if (i == key.length()) {
node.data = new HashMap<Object, Object>();
node.data.put("value", key);
Map<String, String> map = new HashMap<String, String>();
int size = 20;
TernarySearchTrie tree = new TernarySearchTrie();
for (int i = 0; i < size; i++) {
char splitchar;//单词
Map<Object, Object> data;//扩展数据域，存放检索次数，关键码频率等信息。
public Entry(char splitchar) {
this.splitchar = splitchar;
}
public Entry() {
}
}
}
(charIndex));
}
currentNodecurrentNode=currentNode.eqNode;
}elseif(charComp<0){//小于
if(currentNode.loNode==null){
currentNode.loNode=newTSTNode(key.charAt
(charIndex));
if (node.left == null)
node.left = new Entry(c);
node = node.left;
} else {
if (node.right == null)
node.right = new Entry(c);
node = node.right;
}
}
}
public Entry search(String key) {
//向词典树中加入一个单词的过程
privateTSTNodeaddWord(Stringkey){
TSTNodecurrentNode=root;//从树的根节点开始查找
intcharIndex=0;//从词的开头匹配
while(true){
//比较词的当前字符与节点的当前字符
intcharComp=key.charAt(charIndex)-
return node;
}
if (node.equals == null)
node.equals = new Entry(key.charAt(i));//这里要注意，要获取新的单词填充进去，因为i++了
node = node.equals;
} else if (diff < 0) {//没有找到对应的字符，并且下一个左或右节点为NULL，则会一直创建新的节点
String key = it.next().toString();
Entry node = tree.search(key);
System.out.println(node.data.get("value") + ",查找次数："
+ node.data.get("count"));
}
}
private Entry root = new Entry();
if (key == null || key.trim().length() == 0)
return null;
Entry node = root;
int count = 0, i = 0;
while (true) {
if (node == null)
return null;
int diff = key.charAt(i) - node.splitchar;
}
}
}
intcharComp=key.charAt(charIndex)-
currentNode.splitchar;
if(charComp==0){//相等
charIndex++;
if(charIndex==key.length()){
returncurrentNode;
}
if(currentNode.eqNode==null){
}ቤተ መጻሕፍቲ ባይዱ
}
}
Java
package sunfa.tree;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
public class TernarySearchTrie {
public static void main(String[] args) {
(charIndex));
}
currentNodecurrentNode=currentNode.loNode;
}else{//大于
if(currentNode.hiNode==null){
currentNode.hiNode=newTSTNode(key.charAt
(charIndex));
}
currentNodecurrentNode=currentNode.hiNode;
currentNode.splitchar;
if(charComp==0){//相等
charIndex++;
if(charIndex==key.length()){
returncurrentNode;
}
if(currentNode.eqNode==null){
currentNode.eqNode=newTSTNode(key.charAt
}
currentNodecurrentNode=currentNode.loNode;
}else{//大于
if(currentNode.hiNode==null){
currentNode.hiNode=newTSTNode(key.charAt
(charIndex));
}
currentNodecurrentNode=currentNode.hiNode;
public Entry addWord(String key) {
if (key == null || key.trim().length() == 0)
return null;
Entry node = root;
int i = 0;
while (true) {
int diff = key.charAt(i) - node.splitchar;
三叉搜索树就是一种对于字符串的高效处理的字典树
三叉搜索树源代码
privateTSTNodeaddWord(Stringkey){
TSTNodecurrentNode=root;//从树的根节点开始查找
intcharIndex=0;//从词的开头匹配
while(true){
//比较词的当前字符与节点的当前字符
} else {
node = node.right;
}
}
}
/**
*三叉Trie树存在3个节点，左右子节点和二叉树类似，以前key都是存放在二叉树的当前节点中，在三叉树中单词是存放在中间子树的。
*/
static class Entry {
Entry left;
Entry right;
Entry equals;//比对成功就放到中间节点
count++;
if (diff == 0) {
i++;
if (i == key.length()) {
node.data.put("count", count);
return node;
}
node = node.equals;
} else if (diff < 0) {
node = node.left;