b树

B树的构造

 

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80

// a binary tree // node, two child nodes(left, right) // nodes with children are parent node. // child nodes may contain references to their parents.   package main   import (     "fmt"     "io"     "log" )   type BinaryNode struct {     left  *BinaryNode     right *BinaryNode     data  int64 }   type BinaryTree struct {     root *BinaryNode }   type d struct { }   func (d) Write(p []byte) (int, error) {     log.Println("----------", string(p))     return 0, nil }   func (t *BinaryTree) insert(data int64) *BinaryTree {     if t.root == nil {         t.root = &BinaryNode{data: data, left: nil, right: nil}     } else {         t.root.insert(data)     }     return t }   func (n *BinaryNode) insert(data int64) {     if n == nil {         return     } else if data <= n.data {         if n.left == nil {             n.left = &BinaryNode{data: data, left: nil, right: nil}         } else {             n.left.insert(data)         }     } else {         if n.right == nil {             n.right = &BinaryNode{data: data, left: nil, right: nil}         } else {             n.right.insert(data)         }     } }   func print(w io.Writer, node *BinaryNode, ns int, ch rune) {     if node == nil {         return     }     for i := 0; i < ns; i++ {         // fmt.Print(w, " ")     }     fmt.Fprintf(w, "%c:%v\n", ch, node.data)     print(w, node.left, ns+2, 'L')     print(w, node.right, ns+2, 'R') }   func main() {     tree := &BinaryTree{}     tree.insert(100).         insert(-20).         insert(90).         insert(80).         insert(-50)     var dins d = d{}     print(dins, tree.root, 0, 'M') }