C# Programming
05-11-2009, 10:31 PM
suppose input is "zain"
first root will be z and its children will be "a , i , n". then "a" has its children that is "i , n" and "i" has its child that is "n". similarly maintaining the tree by setting root to "a , i , n".
then i am traversing the tree through recursion. i have also check input string " aha" its working. but with long words its throws exp.
first root will be z and its children will be "a , i , n". then "a" has its children that is "i , n" and "i" has its child that is "n". similarly maintaining the tree by setting root to "a , i , n".
then i am traversing the tree through recursion. i have also check input string " aha" its working. but with long words its throws exp.