protected function loadRawOrder($tmpSubTier)
    {
        $nID = $tmpSubTier[0];
        $this->nodesRawIndex[$nID] = sizeof($this->nodesRawOrder);
        $this->nodesRawOrder[] = $nID;
        if (sizeof($tmpSubTier[1]) > 0) {
            foreach ($tmpSubTier[1] as $deeper) {
                $this->loadRawOrder($deeper);
            }
        }
        return true;
    }
protected function loadRawOrder($tmpSubTier)
    {
        $nID = $tmpSubTier[0];
        $this->nodesRawIndex[$nID] = sizeof($this->nodesRawOrder);
        $this->nodesRawOrder[] = $nID;
        if (sizeof($tmpSubTier[1]) > 0) {
            foreach ($tmpSubTier[1] as $deeper) {
                $this->loadRawOrder($deeper);
            }
        }
        return true;
    }
protected function loadRawOrder ( $ tmpSubTier ) { $ nID = $ tmpSubTier [ 0 ] ; $ this -> nodesRawIndex [ $ nID ] = sizeof ( $ this -> nodesRawOrder ) ; $ this -> nodesRawOrder [ ] = $ nID ; if ( sizeof ( $ tmpSubTier [ 1 ] ) > 0 ) { foreach ( $ tmpSubTier [ 1 ] as $ deeper ) { $ this -> loadRawOrder ( $ deeper ) ; } } return true ; }
Cache tree's standard Pre-Order Traversal
Cache tree s standard Pre - Order Traversal