Repeat the previous project, but instead place the duplicate of an entry in the entry’s left or right subtree at random. Thus, we modify the definition of a binary search tree as follows: For each...

Repeat the previous project, but instead place the duplicate of an entry in the entry’s left or right subtree at random. Thus, we modify the definition of a binary search tree as follows: For each node in a binary search tree,

 The data in a node is greater than or equal to the data in the node’s left subtree

The data in a node is less than or equal to the data in the node’s right subtree

Searching for a duplicate must allow a search of both subtrees.