Problem 3.(20 points) Given a binary treeTand a nodevT, complete thefollowing to print the label of inorder successor of each node of the tree rootedatv. Use only the functionsisExternal(v), leftChild(v), rightchild(v),1

label(v)of the treeTand for printing use print statement (e.g. print Inordersuccessor of , label(v), =,label(w)). Your algorithm should use onlyO(h)additional space complexity wherehis the height of the tree.Prove the correctness of your algorithm and derive the time complexity of youralgorithm.printInorderSuccessor(T,v)Input:Binary tree T and node v in TOutput:print in order successor of each node