Binary trees and knock$-$out tournaments

$($a$)$ How many unlabeled binary trees with $6$ leaves are there?

$($b$)$ How many different knock$-$out $($single$-$elimination$)$ tournaments can you design for $6$ players?