binaryTree.c
Node* newNode(int data)
{
	Node* newNode = malloc(sizeof(Node));
        newNode->data = data;
	newNode->left = newNode->right = NULL;
	return newNode;
}
/*
n-node binary tree, track the left most child and right sibling
*/
n-node binary tree, track the left most child and right sibling
n - node binary tree track the left most child and right sibling
Node* newNode(int data)
{
	Node* newNode = malloc(sizeof(Node));
        newNode->data = data;
	newNode->left = newNode->right = NULL;
	return newNode;
}
Node * newNode ( int data ) { Node * newNode = malloc ( sizeof ( Node ) ) ; newNode -> data = data ; newNode -> left = newNode -> right = NULL ; return newNode ; }
n-node binary tree, track the left most child and right sibling
n - node binary tree track the left most child and right sibling