can you explane for me how create optimal binary search tree of set of successful and unsuccessful node
if you can explane by example?