int sumBTree (BTreeNode *root) {
    if (root == NULL) {
        return 0;
    }
    else {
    	int sumOfLeftSubTree = sumBTree (root->left);
	int sumOfRightSubTree = sumBTree (root->right);
	return root->item + sumOfLeftSubTree + sumOfRightSubTree;
    }
}