递归搜索非二叉树中的节点

探索第一个孩子后，您不应该退出。您不需要循环

if

for

private nNode recursiveSearch(data gi,nNode node){    if (node.getdata()==gi)        return node;    nNode[] children = node.getChildren();     nNode res = null;    for (int i = 0; res == null && i < children.length; i++) {      res = recursiveSearch(gi, children[i]);    }    return res; }