Question is belongs to Algorithm subject,

Let the heap be implemented using the binary tree ADT and it can be accessed using only the methods of binary tree ADT $($we don't know whether array or linked list is used to implement it$).$ Write a pseudocode for nding the next node $($that is$,$ the new insertion point$)$ in a tree T given the last node u$.$