Implement the following functionalities of a binary trees:

find(int key)

insert(int id, double data)

traverse(int traverseType)

preOrder(Node* pLocalRoot)

inOrder(Node* pLocalRoot)

postOrder(Node* pLocalRoot)

displayTree()

destroy() //deletes all nodes

destroyRec(Node* pLocalRoot) //delete nodes in a subtree