(value interface{})
| 32 | } |
| 33 | |
| 34 | func (tree *BinaryTree) Insert(value interface{}) { |
| 35 | if tree.node == nil { |
| 36 | tree.node = value |
| 37 | tree.right = New(tree.lessFun) |
| 38 | tree.left = New(tree.lessFun) |
| 39 | return |
| 40 | } |
| 41 | if tree.lessFun(value, tree.node) { |
| 42 | tree.left.Insert(value) |
| 43 | } else { |
| 44 | tree.right.Insert(value) |
| 45 | } |
| 46 | } |
| 47 | |
| 48 | func (tree *BinaryTree) Max() interface{} { |
| 49 | if tree.node == nil || tree.right.node == nil { |