For this tree:
What of the following traversal functions visit the nodes in this order? 26, 30, 32, 8, 3, 5, 21

Question

For this tree:  
 What of the following traversal functions visit the nodes in this order? 26, 30, 32, 8, 3, 5, 21

Answer

function  inRL-order(T)   
       if  !ISEMPTY(T)  then       
            inRL-order(right(T))  
 
            visit(root(T))
 
            inRL-order(left(T))     
   end function

Answer

function  post-order(T)   
       if  !ISEMPTY(T)  then      
             post-order(left(T))   
             post-order(right(T))     
             visit(root(T))  
 end function

Answer

function  postRL-order(T)   
       if  !ISEMPTY(T)  then      
             postRL-order(right(T))   
             postRL-order(left(T))     
             visit(root(T))  
 end function

Answer

none of the others

Answer

function  preRL-order(T)   
       if  !ISEMPTY(T)  then     
 
             visit(root(T))  
             preRL-order(right(T))   
             preRL-order(left(T))     
   end function

Crowdly

For this tree: What of the following traversal functions visit the nodes in t...

Want instant access to all verified answers on learn.gold.ac.uk?