| /* |
| * Licensed to the Apache Software Foundation (ASF) under one or more |
| * contributor license agreements. See the NOTICE file distributed with |
| * this work for additional information regarding copyright ownership. |
| * The ASF licenses this file to You under the Apache License, Version 2.0 |
| * (the "License"); you may not use this file except in compliance with |
| * the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| package util |
| |
| //The tree is binary sort tree |
| type tree struct { |
| root *Node |
| isAddToLeft func(node *Node, addRes interface{}) bool |
| } |
| |
| func NewTree(isAddToLeft func(node *Node, addRes interface{}) bool) *tree { |
| return &tree{ |
| isAddToLeft: isAddToLeft, |
| } |
| } |
| |
| type Node struct { |
| Res interface{} |
| left, right *Node |
| } |
| |
| func (t *tree) GetRoot() *Node { |
| return t.root |
| } |
| |
| //add res into tree |
| func (t *tree) AddNode(res interface{}) *Node { |
| return t.addNode(t.root, res) |
| } |
| |
| func (t *tree) addNode(n *Node, res interface{}) *Node { |
| if n == nil { |
| n = new(Node) |
| n.Res = res |
| if t.root == nil { |
| t.root = n |
| } |
| return n |
| } |
| if t.isAddToLeft(n, res) { |
| n.left = t.addNode(n.left, res) |
| } else { |
| n.right = t.addNode(n.right, res) |
| } |
| return n |
| } |
| |
| //middle oder traversal, handle is the func that deals with the res, n is the start node to traversal |
| func (t *tree) InOrderTraversal(n *Node, handle func(res interface{}) error) error { |
| if n == nil { |
| return nil |
| } |
| |
| err := t.InOrderTraversal(n.left, handle) |
| if err != nil { |
| return err |
| } |
| err = handle(n.Res) |
| if err != nil { |
| return err |
| } |
| err = t.InOrderTraversal(n.right, handle) |
| if err != nil { |
| return err |
| } |
| return nil |
| } |
| |
| //todo add asynchronous handle handle func: go handle |