Q2. Design the pseudocode to print a binary tree. At the visit of a node of the tree, it prints the node based on its (x,y) coordinates where x= the inorder rank of the node and y= depth of the node in the tree. Your algorithm time complexity must be linear in n, i.e., the tight bound on time complexity must be O(n), where n is the number of nodes. You must provide the pseudocode only (no Java code)..

1. Q2. Design the pseudocode to print a binary tree. At the visit of a node of the tree, it prints the
node based on its (x,y) coordinates where x= the inorder rank of the node and y= depth of the
node in the tree. Your algorithm time complexity must be linear in n, i.e., the tight bound on time
complexity must be O(n), where n is the number of nodes. You must provide the pseudocode only
(no Java code).