在NON二叉树中查找节点[Java]

Question

I want to find a node of type T that is located somewhere in a non-binary tree in Java.

Can it be done both recursively and non recursively?

I thought of applying the rules of binary tree search but without the left and right stuff, but I can't get the idea on how to do it.

Answer 1

It depends on if a node in this tree has a fixed number of possible descendants. If it does then you can basically just use the same functions with n more if statements for each possible child. But, if the number of descendants is not fixed then you're dealing with something closer to a graph. In that case you have to use a graph algorithm.