No this is not a Binary Search Tree,Because right of 14,13 not come, it violate the Property of BST.
Is it possible or not
15 is true
Violate the BST Property. 13 not comes,right of 14
mitesh kumar then you're right
ans D ) 64
Soumya Tiwari yes I'm also think in that way
In Binary Search Tree all Sorted elements in ascending order like $11,12,13,14,15,16,17$ gives always INORDER TRAVERSAL of the BST.
With $7$ nodes Number of unlabeled BST Possible are $429$.To get Inorder so we can assign the number in the all BST and get $429$ BST with In order $11,12,13,14,15,16,17$, But some tree doesn't have a height $6$, So we can subtract these BST and get the answer, but I'm not able to find the BST, which doesn't have height $6.$
can anyone help me?
Lakshman Patel RJIT
you choose very very tough path bro... don't follow this approach
This is really nice approach
Magma please add link of above diagram question