📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    Which algorithm constructs a suffix tree in linear

    time?
    A KMP Correct Answer Incorrect Answer
    B Ukkonen’s algorithm Correct Answer Incorrect Answer
    C Tarjan’s algorithm Correct Answer Incorrect Answer
    D Rabin-Karp Correct Answer Incorrect Answer
    E Huffman coding Correct Answer Incorrect Answer

    Solution

    Ukkonen’s algorithm builds suffix trees in O(n). KMP is for pattern search, Rabin-Karp for hashing.

    Practice Next
    More Data Structure Questions
    ask-question
    9