Test by Bikram | Mock GATE | Test 1 | Question: 27

Question

Consider the following algorithm:

ORDER (T)
begin
if (T!=NULL) then
begin
ORDER (LPTR(T))
PRINT (DATA(T))
ORDER (RPTR(T))
end
return
end

where LPTR: left pointer
RPTR: right pointer
T: given tree

This above algorithm is used to:

• A.   Traverse the tree in preorder in a recursive manner
• B.   Traverse the tree in in-order, in a recursive manner
• C.   Traverse the tree in post-order in a recursive manner
• D.    Do not Traverse the tree at all

Answer 1

It's a recursive code for inorder traversal.

Comments

how 'if', and not 'while',?!

---

@Nitin Sharma

here T is the Tree, it may be NULL, thats why there is " if " .

"while" means we assume Tree T never gonna be NULL, which is not the default case !

By default Tree T is NULL , we assume.