code: def from_ordered_sequence(cls, iseq):
          
          seq = list(iseq)
          # optimize for usually all fits by making longest first
          bst = cls(seq.pop())
          bst._insert_from_ordered_sequence(seq)
          return bst
docs: Return the root of a balanced binary search tree populated with the
          values in iterable *iseq*.