用php实现基本二叉树和排序二叉树

基于面向对象的PHP实现了二叉树和BST，实现了一些基本功能，主要用于练习编写PHP程序的熟练度和复习PHP面向对象。其中用到了__construct(),__get()和,__set()。

class btreenode{
private $data = NULL;
private $left = NULL;
private $right = NULL;
function __construct($key=NULL,$left=NULL,$right=NULL){
$this->data = $key;
$this->left=  $left;
$this->right=  $right;
}
function __get($name){ //利用get和set函数实现私有变量的读写
return $this->$name; //注意name前要加$
}
function __set($name,$value){
$this->$name = $value;
}
function inorder(){
echo $this->data;
if($this->left!=NULL)
$this->left->inorder();
if($this->right!=NULL)
$this->right->inorder();
}
function preorder(){
if($this->left!=NULL)
$this->left->preorder();
echo $this->data;
if($this->right!=NULL)
$this->right->preorder();
}
function reorder(){
if($this->left!=NULL)
$this->left->reorder();
if($this->right!=NULL)
$this->right->reorder();
echo $this->data;
}
};


class btree{
private $root = NULL;
function __get($name){
return $this->$name;
}
function __set($name,$value){
$this->$name = $value;
}
}


class bsearchtree extends btree{
function __construct($arr){ //传入一个数组，构造BST
foreach($arr as $value){
if($this->root == NULL){ //构造根节点
$this->root = new btreenode($value);
}
else{
$p = $this->root;
while($p!=NULL){
if($value<$p->__get('data')){ //注意，这里是在读写对象的私有变量，必须get和set函数，不能直接读写值
if($p->__get('left')==NULL){
$p->__set('left',new btreenode($value));
break;
}
else
$p = $p->__get('left');
}
if($value>$p->__get('data')){
if($p->__get('right') == NULL){
$p->__set('right',new btreenode($value));
break;
}
else
$p = $p->__get('right');
}
}
}
}
}
function find($data){
$result = -1;
if(isset($data)){
$p = $this->root;
while($p!=NULL){
if($data == $p->__get('data')){
$result = 1;
break;
}
if($data>$p->__get('data'))
$p = $p->__get('right');
else
$p = $p->__get('left');
}
}
return $result;
}
}