Data structure trie
I have to implement a trie and I don't know how to search an element there. I have to reach to say the 4th character and I don't know how to do that. I've googled enugh but i don't seem to find anything relevant. Thank you!
|
Things to include in your post that would be helpfull.
1. programming language. 2. what is a trie ? you might mean tree 3. is this homework? if so looking in your text book might be of help. 4. is this a binary tree? if so searching though one is quite extensive. |
ok... sorry. A trie is a tree, but not binary :)
http://en.wikipedia.org/wiki/Trie I want this in plain C, yes... this is a homework (i'm not asking for someone to solve it for me, just for help) thank you! |
AHH deep magic.
Sorry not famillar with this type of data structure. thats why I dident know what trie was. Sorry for the mix up thought you were doing a spelling foobar. :p |
How much have you managed to implement?
What does your data structure currently look like? |
The tree nodes and method to implement tries vary considerably. Have you been provided with a node structure or are you implementing this completely?
There is a lot of code already "out there" to help you, but you must be a bit more specific about the parameters. |
well i'm tring to do somthing like this:
search(a,k); search the trie a for the element number k and the trie contains only numbers and the order is considered the lexicografic order not the sort one. |
scapegoat!
How i have to implement a scapegoat tree... this i really can't find any good information on the web. Any ideea ?
|
All times are GMT -5. The time now is 08:09 PM. |