Get the left-most child from node.

Property definitions

trees $ BinTreeMap :: min_from
	# Get the left-most child from `node`.
	protected fun min_from(node: N): N do
		if node.left == null then return node
		return min_from(node.left.as(not null))
	end
lib/trees/bintree.nit:121,2--125,4