make the tree logically empty . concode_field_sep RedBlackNode parent concode_elem_sep RedBlackNode current concode_elem_sep RedBlackNode nullNode concode_elem_sep int RED concode_elem_sep RedBlackNode header concode_elem_sep int BLACK concode_elem_sep RedBlackNode grand concode_elem_sep RedBlackNode great concode_field_sep RedBlackNode rotate concode_elem_sep RedBlackNode rotateWithRightChild concode_elem_sep Comparable find concode_elem_sep boolean isEmpty concode_elem_sep RedBlackNode rotateWithLeftChild concode_elem_sep void insert concode_elem_sep void main concode_elem_sep Comparable findMin concode_elem_sep void handleReorient concode_elem_sep void remove concode_elem_sep Comparable findMax concode_elem_sep void printTree concode_elem_sep void printTree
void function ( ) { header . right = nullNode ; }