binarySearchTree.c – sätta in void insertTree(BinaryTree *bp,Data e) { TreeNode *newNode = (TreeNode*)malloc(sizeof(TreeNode)); newNode->element = e; newNode->left=newNode->right=NULL; if(bp->root==NULL) bp->root=newNode; else insertNodeInTree(bp->root,newNode); } void insertTree(BinaryTree *bp,Data e) { TreeNode *newNode = (TreeNode*)malloc(sizeof(TreeNode)); newNode->element = e; newNode->left=newNode->right=NULL; if(bp->root==NULL) bp->root=newNode; else insertNodeInTree(bp->root,newNode); }