// GetFirstNode - Find and return the left most node of the tree
// This node is the first in the linked list
Find and return the left most node of the tree
This node is the first in the linked list
// GetFirstNode - Find and return the left most node of the tree // This node is the first in the linked list
func (tree *LinkedTree) GetFirstNode() (*LinkedTreeNode, error) {
	tree.mux.Lock()
	defer tree.mux.Unlock()
	if tree.root != nil {
		return tree.root.GetFirstNode()
	}
	return nil, fmt.Errorf("Can't get a node from a tree without a root node")
}
func ( tree * LinkedTree ) GetFirstNode ( ) ( * LinkedTreeNode , error ) { tree . mux . Lock ( ) defer tree . mux . Unlock ( ) if tree . root != nil { return tree . root . GetFirstNode ( ) } return nil , fmt . Errorf ( " " ) }
Find and return the left most node of the tree
This node is the first in the linked list
Find and return the left most node of the tree This node is the first in the linked list