Data Structures and Algorithm

Write a code in c$++$ to store words in a binary search tree in alphabetic

order. Use the following rules of binary search tree:

$1.$ Every word in n$$s left sub$-$tree is less than the word in a node n$.$

$2.$ Every word in n$\text{'}$s right sub$-$tree is greater than or equal to the word in node n$.$

Implement the following methods:

$$ Insert

$$ Find

$$ Delete

$$ Display $($In order$)$

The words list is available as text file, include code for reading the text file. Note that the list of words is in sorted order and if you insert words in the same order then BST will be created as degenerated tree. You must use some technique to prevent this from happening.