It looks like that you are looking for "find" or "search" capability. The browsing functions in OPC-DA (and consequently in QuickOPC) do not support this, at least not throughout the whole tree. In QuickOPC, you can always "emulate" searching by using the elementNameFilter and passing in either the precise node name or a match pattern; however this only works on a single parent node/level, so you already must know "where" to perform your search.
A search that would work throughout the whole address space tree is not supported in OPC-DA specifications, and therefore is only possible by traversing the tree until a match is found. As a general OPC address space tree may be quite large, this search operation would be inherently inefficient, but that may be acceptable if you definitely must have it. The shortest way to implement this is by writing a recursive function that looks for the match at given parent level, and if not found there, it tries the same on all child branches. You would then invoke the search by calling that function on a root level (an empty string for the parent).
Let me know if this explanation is sufficient to you. If you do not feel like writing this function, I can put together an example for you; in such case, please let me know which language you prefer (C#, VB.NET ...).
Kind regards,
ZZ