Arvind Raj T

Let me take up this one @czgdp1807

`suffix` I believe the API design would be like the below part ` __new__(cls, array_flag = 0, key=None, root_data=None)` This would initialise a new suffix tree. Rest of the parameters...

https://www.cise.ufl.edu/~sahni/dsaaj/enrich/c16/suffix.htm hope in this site we get the example with analyzation and implementation example is as https://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-6/?ref=rp

As suffix tree isn't like any other binary tree i hope it has to be implemented in separate file and shall I go on with that @czgdp1807

As far my research on the above tree after the conversation !. It is static and cannot changed after implementation as given in reference with https://users.dcc.uchile.cl/~gnavarro/ps/cpm08.2.pdf 2. Cool then just...

suffix `__new__(cls, strings)` The implementation of several features are quite complicated I hope it should be done step by step.

@czgdp1807 Cool, I'm working on that

@czgdp1807 I hope this tree has already been implemented why not close this one!

@czgdp1807 Let me take up this work and it seems the Parallel matrix multiplication was already implemented and what's left is Sequential multiplication. Should I go with Strassen algorithm for...

> This issue is not in priority as of now. Ok I will look for other issues