Login or Create an Account to view the mark scheme, comment, and add to a test
Assuming the typical binary search tree structure, select the procedure which logically represents an in-order binary search tree traversal.
(a).
method INORDER(tree) INORDER(right-tree) OUTPUT current node INORDER(left-tree) end method
(b).
method INORDER(tree) INORDER(left-tree) INORDER(right-tree) OUTPUT current node end method
(c).
method INORDER(tree) OUTPUT current node INORDER(right-tree) INORDER(left-tree) end method
(d).
method INORDER(tree) INORDER(left-tree) OUTPUT current node INORDER(right-tree) end method

Multiple Choice1 MarkPremium
30 Uses38 Views1 Like