Recently I read some interview questions on gfg of amazon sde-1 , and this question has no solution till now , so asked here , the q. is :

**Print all three nodes in a binary tree such that sum of all these three nodes is greater than given x and these three nodes must hold the relationship of grandparent-parent-child.
**

**Expected Complexity – O(n)**

@L_returns @aryanc403 @anon55659401 @akshay_1 @samarthtandon @hetp111 @ashokshaun @s5960r