$1.$ Design the algorithm and method following operations for a binary tree T:

$$ inorderNext$($p$)$: Return the position visited after p in an inorder traversal of T $($or null if p is the last node visited$).$

$$ postorderNext$($p$)$: Return the position visited after p in a postorder traversal of T $($or null if p is the last node visited$).$

Write a Java to test your solution.

What are the worst$-$case running times of your algorithms?