A binary tree node has data , the pointer to left child and a pointer to right child
struct node { int data ; struct node * left ; struct node * right ; struct node * parent ; } ; struct node * minValue ( struct node * node ) ;