title: Number of binary tree shapes of N nodes are there with height N-1?
body: <p>How many binary tree shapes of N nodes are there with height N-1?
  Also, how would you go about proofing by induction?</p>
  
  <p>So binary tree of height n-1 with node n means all node will have only 1 child, sort of chain like structure? So number of binary tree will be different permutation of n numbers which is n. Am I thinking in the right direction?</p>