How to realize fast query of data in treeview

shy616007

I am currently solving a problem, which is how to achieve the following situation:
A
A1
  A11
A2
  A21
  A22
A3
B
B1
  B11
   B111
.......
Z
There are 7 levels of relationship, I would like to ask, how to quickly realize the query?

stevevai

This depends on whether the thing you are looking for is regular. If not, there is no good way. Just like your example, if there is a regularity, you can decompose the string you are looking for. How many bits represent which LEVEL of the Treeview. Then return to the obtained index to continue to check, here recursive method. But the query is one-way in depth. No need to traverse all!

dingobest

Use Treeview.select.text as a conditional query

coolfox365

Specify SortType first, and then use dichotomy to find