in java give me implementation for the following methods of binary search tree $.$Give me full implemenentation and main build up BTS i can use to check my code

$//$methods

Boolean search$($int id$)$

void insert$($int id$,$ String name$)$

void delete$($int id$)$

void split $($int id$)$

$\}$