将深度优先搜索值存储到php中的数组中

// 定义一个数组用于存储深度优先搜索的值
$dfsArray = array();

// 定义一个递归函数来进行深度优先搜索
function dfs($node) {
    global $dfsArray;
    
    // 将当前节点的值存储到数组中
    $dfsArray[] = $node->value;
    
    // 遍历当前节点的子节点
    foreach ($node->children as $child) {
        dfs($child);
    }
}

// 示例节点类
class Node {
    public $value;
    public $children;
    
    public function __construct($value) {
        $this->value = $value;
        $this->children = array();
    }
}

// 创建示例树
$root = new Node(1);
$node2 = new Node(2);
$node3 = new Node(3);
$node4 = new Node(4);
$node5 = new Node(5);

$root->children[] = $node2;
$root->children[] = $node3;
$node2->children[] = $node4;
$node3->children[] = $node5;

// 进行深度优先搜索
dfs($root);

// 打印结果
print_r($dfsArray);