golang binarySearch

 func binarySearch(nodes []*node, word Text) (int, bool) {
     start :=
     end := len(nodes) - 

     // 特例：
     if len(nodes) ==  {
         // 当slice为空时，插入第一位置
         return , false
     }
     compareWithFirstWord := bytes.Compare(word, nodes[].word)
     if compareWithFirstWord <  {
         // 当要查找的元素小于首元素时，插入第一位置
         return , false
     } else if compareWithFirstWord ==  {
         // 当首元素等于node时
         return , true
     }
     compareWithLastWord := bytes.Compare(word, nodes[end].word)
     if compareWithLastWord ==  {
         // 当尾元素等于node时
         return end, true
     } else if compareWithLastWord >  {
         // 当尾元素小于node时
         return end + , false
     }

     // 二分
     current := end /
     for end-start >  {
         compareWithCurrentWord := bytes.Compare(word, nodes[current].word)
         if compareWithCurrentWord ==  {
             return current, true
         } else if compareWithCurrentWord <  {
             end = current
             current = (start + current) /
         } else {
             start = current
             current = (current + end) /
         }
     }
     return end, false
 }