Binary Search Tree

Question

1) How many ways we can traverse 1,2,3,4 in BST?

2) How many ways we can insert 1,2,3,4 in BST?

______________________________________________________________________

How both are different in calculation of BST?Why they are use different formula?

Comments

I mean formula used for calculation of no of bst should be same for calculation of no of traversal

---

did you comment for me or srestha mam ?

if it is for me, in my comments also i said that only, refer my comments

if it is for srestha mam, leave it

---

@Kaluti

no of bst should be same for calculation of no of traversal

what is meaning of it? 

Answer 1

I didn't understand, for inserting we can insert in 1/(n+1)*2nCn ways and for traversing these it will be the same right? @Masthan ?Please correct me if I'm wrong.