0
$\begingroup$

I am trying to make my Trie tree structure as compact as possible. While searching about this I came across to "Level order Unary Degree Sequence " i.e. LOUDS representations using bit vector.

But I could not understand how to build it? Because it requires a degree of your nodes in advance. Or you have a Trie tree build already. So using level order traversing we can make a LOUDS representation of the Trie tree.

Can anyone help me in understanding?

Note: I am trying to make a space-efficient data structure for top k completion.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.