The binary search trees can be used ...arrange the given elements in
binary search tree ...search for each element in the tree count
the number of nodes along its left successors until the leaf node is
reached ...!! thats the ans !!
On Jul 26, 6:53 pm, Someshwar Chandrasekaran
wrote:
> On Tu
suffix tree can be used print all the nodes...u ll get every
substring ..!!
On Jul 26, 8:51 pm, Ankur Garg wrote:
> Hey Guys
>
> Can we use KMP Algorithm here to generate permutations...May be a bit
> modification is req
>
> On Tue, Jul 26, 2011 at 9:07 PM, keyan karthi
> wrote:
>
>
>
>
>
>
