php二叉树基本遍历和非递归遍历

tree.php

<?php
require_once "./zhan.php";
class BinNode{
	public $ch;
	public $lchild;
	public $rchild;
	public function __construct($data){
		$this->ch=$data;
		$this->lchild=null;
		$this->rchild=null;
	}
	
}

//封装自己数据类型
class mydata{
	public $BinNode;
	public $status;
	public function __construct($data,$status){
		$this->BinNode=$data;
		$this->status=$status;
	}
}

class twofucktree{

	//初始化
	public function init_tree()
	{
	/*

	    A
	B		F
  C			   G
D   E	     H

	*/
		$nodeA= new BinNode('A');
		$nodeB= new BinNode('B');
		$nodeC= new BinNode('C');
		$nodeD= new BinNode('D');
		$nodeE= new BinNode('E');
		$nodeF= new BinNode('F');
		$nodeG= new BinNode('G');
		$nodeH= new BinNode('H');

		$nodeA->lchild = $nodeB;
		$nodeA->rchild = $nodeF;
		$nodeB->rchild = $nodeC;
		$nodeC->