#include <stdio.h>
#include "Tree.h"

Tree forked(TreeElementType E, Tree L, Tree R)
/* construct the tree <L,E,R> from element E and subtrees L and R.  L.Allison*/
 { Tree T;  T = (Tree)malloc(sizeof(Node));
   T->left  = L;
   T->right = R;
   TreeElementMove(E, &(T->elt));
   return T;
 }/*forked*/

int empty(Tree T) { return ( T==NULL ? 1 : 0 ); }

Tree left(Tree T)
/* pre: T is not null */
 { return T->left; }

Tree right(Tree T)
/* pre: T is not null */
 { return T->right; }

/* Some Basic Tree Operation */