inserts a key-value pair into the tree , if not already exists . in case if key is found , then its corresponding value is replaced . if value is null , then the entry will be deleted from tree . concode_field_sep Value val concode_elem_sep Node left concode_elem_sep Node root concode_elem_sep Node right concode_elem_sep Key key concode_elem_sep int N concode_field_sep Key ceiling concode_elem_sep Node ceiling concode_elem_sep boolean contains concode_elem_sep Key select concode_elem_sep Key select concode_elem_sep Key min concode_elem_sep Node min concode_elem_sep int size concode_elem_sep int size concode_elem_sep Key max concode_elem_sep Node max concode_elem_sep Value get concode_elem_sep Value get concode_elem_sep boolean isEmpty concode_elem_sep int rank concode_elem_sep int rank concode_elem_sep void deleteMin concode_elem_sep Node deleteMin concode_elem_sep Key floor concode_elem_sep Node floor concode_elem_sep void delete concode_elem_sep Node delete
void function ( Key arg0 , Value arg1 ) { root = put ( root , arg0 , arg1 ) ; }