This problems was resolved 2 /12 years ago by using a custom solution due to our unique requirements.  You can close/delete this post. 

That's the tricky part and there may be different solutions.

Once you have the data base item you're searching for, you can go through its parent items reaching the root item of the current branch. Then you can fill each node's children in reverse order until you reach the searched item (node) and select it...

If you encounter difficulties with that, you can send me the sample project with the server side searching implemented and will try to implement the populating of required nodes.

Yes, I could do the search on the server-side, but how could I open to the node with the corresponding data on the client once its found?  Or do you have other thoughts on how to indicate which node was found?

Yes, implementing client-side search for the tree surely adds some more complexity to the solution.

Unfortunately even if we have lazy initialization of the nodes (initialize a node object the first time it is accessed), in your case there still will be performance issues once you start searching the tree, because the nodes initialization will take place then...

Have you considered the option to implement the search on the server side, directly in the data base?