given n nodes ,how many different possible tree can be formed??(not
necessary that all are binary treeit could be any tree...)
--
*WITH REGARDS,*
*
*
*KARTIK SACHAN*
*B.TECH 3rd YEAR*
*COMPUTER SCIENCE AND ENGINEERING*
*NIT ALLAHABAD*
--
You received this message because you are
2nCn/(n+1) ..simple maths :)
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
http://gplus.to/amolsharma99
http://twitter.com/amolsharma99http://in.linkedin.com/pub/amol-sharma/21/79b/507http://youtube.com/amolsharma99
On Sun, Sep 18, 2011 at 12:37
(2n)! / ((n+1)! + (n)!)
Where n is the number of nodes.
The above mentioned formula is for the n'th Catalan number.
@all correct me if I am wrong
On Sun, Sep 18, 2011 at 7:11 AM, Amol Sharma amolsharm...@gmail.com wrote:
2nCn/(n+1) ..simple maths :)
--
Amol Sharma
Third Year
@Amol:the answer u have given is for binary ..and thats catalan
number...recursive solution
On Sun, Sep 18, 2011 at 1:33 PM, Anup Ghatage ghat...@gmail.com wrote:
(2n)! / ((n+1)! + (n)!)
Where n is the number of nodes.
The above mentioned formula is for the n'th Catalan number.
wap a program in efficient manner to remove all occurrence of
duplicate character in the word and all occurrence of duplicate word
in the file.
i break the problem in two section( this is my approach it may be
better one )
wap to remove all duplicate character in the word. (order is important)
