data structures - Exploring a binary search tree -


i figure binary search tree simplest example, know how explore ternary search tree or variety of tries. don't have experience these, understand concepts of adding , searching them.

my question is, when find node matches input (like autocomplete) how gather of child nodes?

it depends on implementation of search tree. if obtaining of child nodes of specific node common operation need perform, should use implementation makes operation efficient.

for example, each node store children array contains pointers each of node's children.


Comments

Popular posts from this blog

linux - Does gcc have any options to add version info in ELF binary file? -

javascript - Clean way to programmatically use CSS transitions from JS? -

android - send complex objects as post php java -