Definition and Algorithm for a Trie Tree

Question

1.00/5 (1 vote)

See more:

Can anyone explain me what is a trie tree?
Do you hav any algorithm for implementing it?

Thanks in Advance..

Posted 23-Jan-13 20:09pm

Comments

PIEBALDconsult 24-Jan-13 2:21am

There are several articles on here that could answer that. But why would you be asking?

2 solutions

Add a Solution

Treat my content as plain text, not as HTML

…

Sign in to your account

Download, Vote, Comment, Publish.

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Tadit Dash (ତଡିତ୍ କୁମାର ଦାଶ) · Answer 1 · 2013-01-23T20:33:00

Please check the below articles.

Explanation
1. TRIE TREES [^].
2. Trie[^].

Implementation
1. Algorithm: The implementation of Trie Tree (C++)[^]

Thanks...

Posted 23-Jan-13 20:33pm

Sergey Alexandrovich Kryukov · Answer 2 · 2013-01-23T20:18:00

—SA

Posted 23-Jan-13 20:18pm