Problem - Given a binary tree how to find the position of right most node in last level of complete binary tree?\ne.g -   [18,15,30, 40,50,100,40,8,7,9,null,null,null,null,null]\n\n![image](https://assets.leetcode.com/users/images/3668f150-bb8b-4efd-b7ab-8a3da8f460eb_1625414622.262347.png)\n\t\nAns. - 9\n\nCan anyone provide me solution and explanation to this problem?\n

Problem - Given a binary tree how to find the position of right most node in last level of complete binary tree?\ne.g -   [18,15,30, 40,50,100,40,8,7,9,null,nul