Question

2. a. How many ways are there that can produce the worst case when we insert the elements A X C S E R H into an empty BST?

b. How many binary tree shapes of n nodes are there with height n-1?

Answer 1

******************************************************************************************
Please Upvote the answer as it matters to me a lot :)
*****************************************************************************************
As per HomeworkLib expert answering guidelines,Experts are supposed to answer only certain number of questions/sub-parts in a post.Please raise the remaining as a new question as per HomeworkLib guidelines.
******************************************************************************************

worst case can happen when the tree formed is a skew tree,

there are only 2 ways you can form a skew tree with the given input,

inserting in the given order

1) A C E H R S X

2) X S R H E C A

b) if the height is n-1 with n nodes then it must be a skew tree, so there are only 2 shapes, one is left skew tree, other right skew trees