func (t *Tree) Root() *Node {
	newNodes := t.Nodes
	for {
		newNodes = levelUp(newNodes)
		if len(newNodes) == 1 {
			break
		}
	}
	return newNodes[0]
}
// Root generates a hash tree bash on the current nodes, and returns the root
// of the tree
Root generates a hash tree bash on the current nodes, and returns the root
of the tree
// Root generates a hash tree bash on the current nodes and returns the root // of the tree
func (t *Tree) Root() *Node {
	newNodes := t.Nodes
	for {
		newNodes = levelUp(newNodes)
		if len(newNodes) == 1 {
			break
		}
	}
	return newNodes[0]
}
func ( t * Tree ) Root ( ) * Node { newNodes := t . Nodes for { newNodes = levelUp ( newNodes ) if len ( newNodes ) == 1 { break } } return newNodes [ 0 ] }
Root generates a hash tree bash on the current nodes, and returns the root
of the tree
Root generates a hash tree bash on the current nodes and returns the root of the tree