0 votes 0 votes The number of binary search tree’s with 4 nodes (1, 2, 3, 4) possible where in every binary search tree ‘1’ is leaf node are ..... How to solve such type of questions in the simple way? himgta asked Apr 13, 2018 himgta 290 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Soumya29 commented Apr 15, 2018 reply Follow Share 5 ? 0 votes 0 votes pankaj_vir commented Apr 15, 2018 reply Follow Share $n^{th}$ Catalan Number, where n = 3 Answer is 5 1 votes 1 votes Please log in or register to add a comment.
