@BoatSushii theoretical cs studen:
do not play no games because they a waset of time be money
and then write 500 lean proof talm bout some /-- (B1) The chosen edge is an edge of the list with the right head, and heads are never u. -/
theorem bst_some {L : List ℕ} {v b : ℕ} (h : bst dst wt