Just a quick question:
Is a suffix tree (a tree that stores suffixes of words) a type of b-tree please?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Just a quick question:
Is a suffix tree (a tree that stores suffixes of words) a type of b-tree please?
No, the two are not really the same. Some B trees are vaguely similar to a suffix tree in storing only enough of a key for uniqueness. Other than that, however, there’s almost no resemblance between the two at all. In particular, a B tree is defined largely in terms of balancing the tree, which isn’t normally used with a suffix tree at all.