Java: Find right Sibling of a binary tree with parent pointers

Difficulty Level: MEDIUM

Problem Statement:

Given a binary tree with parent pointers, find the right sibling of a given node (pointer to the node will be given), if it doesn’t exist return null.

Input:

Given below tree with parent pointer and node 10

Output:

12