Algorithm to find a node in an unordered tree?

Question

Algorithms

There is an unordered tree in which each node can have any number of children
. Is there an algorithm for finding a node by its key that does not require iterating through the entire tree?

When forming a tree, we can add arbitrary fields to each node

Answer 1

In a NOT ordered tree, there is no such algorithm. This is no different from searching in a NOT ordered array. Both tasks require viewing the entire set of elements. When ordering - you can think about improving the efficiency of the algorithm.