Recurrence relation and time complexity of finding next larger in Generic tree

Question

Question: Given a generic tree and an integer n. Find and return the node with next larger element in the tree i.e. find a node with value just greater than