Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
For this tree:
What of the following traversal functions visit the nodes in this order?
4, 18, 3, 30, 20, 22, 0
function preRL-order(T) if !ISEMPTY(T) then visit(root(T)) preRL-order(right(T)) preRL-order(left(T)) end function
none of the others
in-order(left(T))
function pre-order(T) if !ISEMPTY(T) then visit(root(T)) pre-order(left(T)) pre-order(right(T)) end function
post-order(right(T))
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!