日期:2011-12-12 浏览次数:20448 次
PHP实现二叉树、线索二叉树,如下代码:
- <?php
- require 'biTree.php';
- $str = 'ko#be8#tr####acy#####';
- $tree = new BiTree($str);
- $tree->createThreadTree();
- echo $tree->threadList() . "\n";从第一个结点开始遍历线索二叉树
- echo $tree->threadListReserv();从最后一个结点开始反向遍历
- ?>
- //biTree.php
- <?
- //结点类
- class Node{
- private $data = NULL;
- private $left = NULL;
- private $right = NULL;
- private $lTag = 0;
- private $rTag = 0;
- public function Node($data = false){
- $this->data = $data;
- }
- //我不喜欢使用魔术方法
- public function getData(){
- return $this->data;
- &