@WgpShashank ++1 :)
Thanks
Ashu
CSE , IITD
On Tuesday, February 14, 2012 9:33:46 PM UTC+5:30, WgpShashank wrote:
>
> HI , consider that each value could be the root. Recursively find the
> size of the left and right subtrees. thats it .
>
> lets try for n=2 e.g. 1,2 there ways to select th
HI , consider that each value could be the root. Recursively find the
size of the left and right subtrees. thats it .
lets try for n=2 e.g. 1,2 there ways to select the root wither 1 or 2 , if
u choose one , size of left subtree will be 0 & size of right subtree will
be 1 so
, similarly i
