4 votes 4 votes Four vertices (A,B,C,D) is given which have only vertex D as a leaf. Total number of binary trees possible when every binary tree has four nodes is ________ Shadan Karim asked Dec 13, 2018 edited Dec 13, 2018 by Shadan Karim Shadan Karim 527 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Devwritt commented Dec 13, 2018 reply Follow Share i got 48 @Shadan Karim what is the asnwer? 0 votes 0 votes Shadan Karim commented Dec 13, 2018 reply Follow Share Given is 48, please explain 0 votes 0 votes Devwritt commented Dec 13, 2018 reply Follow Share @Shadan Karim please check answer below 0 votes 0 votes Please log in or register to add a comment.
8 votes 8 votes When A is root element: Total 16 combination when A is root element Similarly, for element B and C So, total 16*3= 48 Binary Tree Devwritt answered Dec 13, 2018 Devwritt comment Share Follow See all 2 Comments See all 2 2 Comments reply Shadan Karim commented Dec 13, 2018 reply Follow Share Excellent explanation @Devwritt 0 votes 0 votes Devwritt commented Dec 13, 2018 reply Follow Share Thanks @Shadan Karim 0 votes 0 votes Please log in or register to add a comment.