HR30 Day 23: BST Level-Order Traversal/PHP

개요

• HR30 Day 23: BST Level-Order Traversal

<?php
class Node{
    public $left,$right;
    public $data;
    function __construct($data)
    {
        $this->left=$this->right=null;
        $this->data = $data;
    }
}
class Solution{
    public function insert($root,$data){
        if($root==null){
            return new Node($data);
        }
        else{            
            if($data<=$root->data){
                $cur=$this->insert($root->left,$data);
                $root->left=$cur;
            }
            else{
                $cur=$this->insert($root->right,$data);
                $root->right=$cur;
            }
            return $root;
        }
    }

	public function levelOrder($root){
        //Write your code here
        $q = [];
        $q[] = $root;
        while( count($q)>0 && !is_null($q[0]) ) {
            $node = array_shift($q);
            echo $node->data." ";
            if(!is_null($node->left)) $q[]=$node->left;
            if(!is_null($node->right)) $q[]=$node->right;             }
    }

}//End of Solution
$myTree=new Solution();
$root=null;
$T=intval(fgets(STDIN));
while($T-->0){
    $data=intval(fgets(STDIN));
    $root=$myTree->insert($root,$data);
}
$myTree->levelOrder($root);
?>