ЁЯУв Too many exams? DonтАЩt know which one suits you best? Book Your Free Expert ЁЯСЙ call Now!

    тЪб Month End Offer - Flat 52% Off On All Courses! Enroll Now тЪб
    00:00:00 AM Left

    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