lib/binary_search_tree/tree.rb
def min(node = root)
      return node if node.left.nil?

      min(node.left)
    end
# Provide the node corresponding to the min value stored in the BST tree (or sub-tree)
# @param node [BinarySearchTree::Node] the root node of the tree/sub-tree to find the min value of
# @return [BinarySearchTree::Node] the node with the min value
Provide the node corresponding to the min value stored in the BST tree (or sub-tree)
Provide the node corresponding to the min value stored in the BST tree ( or sub - tree )
def min(node = root)
      return node if node.left.nil?
      min(node.left)
    end
def min ( node = root ) return node if node . left . nil? min ( node . left ) end
Provide the node corresponding to the min value stored in the BST tree (or sub-tree)
Provide the node corresponding to the min value stored in the BST tree ( or sub - tree )
the node with the min value
the node with the min value
BinarySearchTree::Node
node
the root node of the tree/sub-tree to find the min value of
the root node of the tree / sub - tree to find the min value of
root