PHP QW\FW\DataStructures\Trees\Binary AbstractBinaryTree::getData Examples

Example #1

File: EulerTourIterator.php Project: rendix2/QW_MVS

 protected function order(AbstractBinaryTree $root = NULL)
 {
     $this->finalData[] = $root->getData();
     if ($root->getLeftChild() != NULL) {
         $this->order($root->getLeftChild());
     }
     $this->finalData[] = $root->getData();
     if ($root->getRightChild() != NULL) {
         $this->order($root->getRightChild());
     }
     $this->finalData[] = $root->getData();
 }

Example #2

File: EulerTourIterator.php Project: rendix2/QW_MVS

 protected function order(AbstractBinaryTree $root = NULL)
 {
     $this->finalData[] = $root->getData();
     if ($root->getLeftChild() != NULL) {
         $this->order($root->getLeftChild());
     }
     $this->finalData[] = $root->getData();
     if ($root instanceof TernaryTree && $root->getMiddleChild() != NULL) {
         $this->order($root->getMiddleChild());
         $this->finalData[] = $root->getData();
     }
     if ($root->getRightChild() != NULL) {
         $this->order($root->getRightChild());
     }
     $this->finalData[] = $root->getData();
 }

Example #3

File: PreOrderIterativeIterator.php Project: rendix2/QW_MVS

 protected function order(AbstractBinaryTree $root = NULL)
 {
     while (!$this->stack->isEmpty() || $root != NULL) {
         if ($root != NULL) {
             $this->finalData[] = $root->getData();
             if ($root->getRightChild() != NULL) {
                 $this->stack->push($root->getRightChild());
             }
             $root = $root->getLeftChild();
         } else {
             $root = $this->stack->pop();
         }
     }
 }