Exemplos de QW\FW\DataStructures\Trees\Binary AbstractBinaryTree::getLeftChild em PHP

Exemplo n.º 1

Arquivo: EulerTourIterator.php Projeto: 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();
 }

Exemplo n.º 2

Arquivo: EulerTourIterator.php Projeto: 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();
 }