PHP实现 二叉树

<?php
/**
 * Created by PhpStorm.
 * User: baimayou
 * Date: 19-3-20
 * Time: 下午3:39
 * 二叉树
 * 首先根据二叉树的结构建立二叉树，定义左右子树和节点的值
 * 二叉树的遍历主要利用递归的思想，按照顺序输出节点的值
 * 二叉树的查找可以根据遍历的方式进行查找
 */
//定义二叉树的节点
class Node{
    public $left = null;
    public $right = null;
    public $data = '';
    public function __construct($data){
        $this->data = $data;
    }
    //二叉树的添加
    function buildTree(Node $lchild = Null,Node $rchild = Null){
        if(!is_null($lchild)){
            $this->left = $lchild;
        }
        if(!is_null($rchild)){
            $this->right = $rchild;
        }
    }
}
//二叉树的前序遍历
function preOrder($tree){
    if($tree != null){
        echo $tree->data;
        preOrder($tree->left);
        preOrder($tree->right);
    }
}
//二叉树的中序遍历
function inOrder($tree){
    if($tree != null){
        inOrder($tree->left);
        echo $tree->data;
        inOrder($tree->right);
    }
}
/