A binary tree node has data , pointer to left child and a pointer to right child
struct Node { int data ; struct Node * left , * right ; Node ( int data ) { this -> data = data ; left = right = NULL ; } } ;