2 votes 2 votes The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$ DS nielit2017oct-assistanta-it data-structures binary-tree + – admin asked Apr 1, 2020 edited Sep 30, 2020 by soujanyareddy13 admin 980 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Since its not mentioned whether the nodes are labelled or not, so taking un-labelled nodes in general, maximum number of binary trees = 2nCn / n+1 This gives 14 binary trees which is option C rish1602 answered Jul 12, 2021 rish1602 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes $\textit{There is one binary tree with one node. }$ $\textit{There are two differently shaped trees with two nodes. }$ $\textit{There are 14 different (shaped) binary trees with four nodes.}$ $\textit{These different trees are shown below.}$ Ref: https://courses.cs.duke.edu/fall03/cps100/assign/writtentree/ https://www.geeksforgeeks.org/total-number-of-possible-binary-search-trees-with-n-keys/ aryavart answered Jul 14, 2021 aryavart comment Share Follow See all 0 reply Please log in or register to add a comment.