A binary tree node has data , pointer to left child and a pointer to right child
class Node { int data ; Node left ; Node right ; Node ( int data ) { this . data = data ; this . left = null ; this . right = null ; } } class GFG {