// BST.h
#ifndef BST_H_INCLUDED
#define BST_H_INCLUDED

// Scelta tra ADT I Categoria, Quasi ADT item standard oppure Item adhoc
#include "Item.h"

typedef struct binarysearchtree *BST;

BST BSTinit();
void BSTfree(BST bst);
int BSTcount(BST bst);
int BSTempty(BST bst);
Item BSTsearch(BST bst, Key k);
void BSTinsert_leafI(BST bst, Item x);
void BSTinsert_leafR(BST bst, Item x);
void BSTinsert_root(BST bst, Item x);
void BSTdelete(BST bst, Key k);
Item BSTmin(BST bst);
Item BSTmax(BST bst);
Item BSTselect(BST bst, int k);
void BSTvisit(BST bst, int strategy);
Item BSTsucc(BST bst, Key k);
Item BSTpred(BST bst, Key k);
void BSTpartition(BST bst, int k);














#endif // BST_H_INCLUDED