The follwoing algorithm performs a traversal of a binary tree and returns some value based on the keys stored in the nodes.

6. The following algorithm performs a traversal of a binary tree and returns some value based on the keys stored in the nodes. Algorithm traverse2(r) Input: Root r of a binary tree if r is a leaf then return key stored at r else a ?traverse2(left child of r) if a > key stored in r then a ? key stored in r b