PYTHON:

Code that creates a binary search tree by selecting 100 random integers from 1 to 500 randomly (numbers can be repeated or can force no repetition) and places them into a binary search tree that doesn't have to be balanced and measures the height of the tree by its number of rows. Then calculate the average height, min height, and max height when computed 100 times. (height is number of rows for instance if numberss inputed in order are 1,2,3,4,5 the height of the binary search tree is 5)

Thank you!