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.
Which data structure is better at creating a dictionary based text editor? DAWG or Radix Tree?
Please give your analysis based on their ease of creation vs there speed; also provide any links if you can on how could i create these?
It depends on what you are trying to achieve although:-
DAWG has an advantage of memory utilization.
Radix tree performs insertion, deletion and searching in O(k) time which is O(logn) in Balanced trees.