Redirecting to
NADOS

Dfs In Suffix Tree

Suffix Tree is implemented for you, you just have to write the code for DFS traversal and print all the suffixes in lexicographical order
Input Format
Given a string S
Output Format
Output each suffix in lexicographical order on different lines
Question Video
Constraints
|S| <= 10^5
Sample Input
abca
Sample Output
$
a$
abca$
bca$
ca$


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name