private void addRootNode(TrieNode rootNode){
        //计算节点的存储索引
        int index = rootNode.getCharacter()%INDEX_LENGTH;
        //检查索引是否和其他节点冲突
        TrieNode existTrieNode = ROOT_NODES_INDEX[index];
        if(existTrieNode != null){
            //有冲突，将冲突节点附加到当前节点之后
            rootNode.setSibling(existTrieNode);
        }
        //新增的节点总是在最前
        ROOT_NODES_INDEX[index] = rootNode;
    }
private void addRootNode ( TrieNode rootNode ) { int index = rootNode . getCharacter ( ) % INDEX_LENGTH ; TrieNode existTrieNode = ROOT_NODES_INDEX [ index ] ; if ( existTrieNode != null ) { rootNode . setSibling ( existTrieNode ) ; } ROOT_NODES_INDEX [ index ] = rootNode ; }
新增一个根节点
@param rootNode 根节点