protected static final class LTST.Node<E> extends TST.Node
B=51+E(类型字节)+对齐填充
若E为String,则B=41+64+2*n(n为字符串长度)=105+2*n+对齐填充 三向单词查找树相比常规单词查找树可节省内存消耗而且不受字母表大小的限制
E
val
c, leaf, left, mid, right
Node(char c)
left, mid, right
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public E val
public Node(char c)
Copyright © 2022. All rights reserved.