(compareFun Comparable)
| 10 | } |
| 11 | |
| 12 | func New(compareFun Comparable) *BinaryTree { |
| 13 | return &BinaryTree{ |
| 14 | node: nil, |
| 15 | lessFun: compareFun, |
| 16 | } |
| 17 | } |
| 18 | |
| 19 | func (tree *BinaryTree) Search(value interface{}) *BinaryTree { |
| 20 | if tree.node == nil { |
no outgoing calls