$0,1,2,3,4$

$0c-0-0$

$10-2=$

$200-1$

$30-0-$

$4,t\frac{,}{b}ar(1),-,-\frac{,}{b}ar(2)$

$,0,1,2,3,4$

$0vvvvvv0-$

$1,0,-,v,0,-$

$2,0,0,v,v,v$

$30-0,v$

$4$ g v $vv=$

$15$

Code Execution Successful $===$

which algorithm produced a smaller tree