I would like to add Binary Search Tree in Java with following methods:
add element
remove element
find element
preorder traversal
inorder traversal
postorder traversal

Each of this methods can be implemented both recursively and iteratively.