code: func (t *Trie) Get(path, version string) (*Trie, string, string, bool) {
  	key, path := t.SplitPath(path)
  	// search the key recursively on the tree
  	if node, ok := t.contains(key, version); ok {
  		if path == "" {
  			return node, key, path, true
  		}
  		return node.Get(path, version)
  	}
  	// if not fount check for catchall or regex
  	return t, key, path, false
  }
docs: // Get returns a node