The document provides instructions to implement a binary search tree (BST) class with String and int data fields to store names and rankings. It then directs the creation of two BST objects: boysNameTree and girlsNameTree, which should each be populated with top 10 baby names from a given list. The trees are then to be searched for each name on the list and any names not on the list, printing the found names and rankings or indicating not found.

1. Python Pls !
implement a Binary Search Tree. You only need to implement one BST. When you complete the
driver, use the same class to create 2 different objects. The purpose of this tree is just to say yes
or no the node exists in the tree and prints out the node data.
In your node class, you will have
String sData; // represents name
int iData; // represents place on top ten list
Node left; // left child (left subtree)
Node right; // right child (right subtree)
In your driver
Do not ask for user input.
Print only from driver, do not print in tree class.
Make a tree, named boysNameTree.
Insert each boy name into the tree.
Search for the names in the list, when found print their name (sData) and placement (iData) on
the top ten list.
Search a name not listed and your name.
Create a new tree girlsNameTree.
Insert each girl name into the tree.
Search for the names in the list, when found print their name (sData) and placement (iData) on
the top ten list.
Search a name not listed and your name.
Print the results of each method call.
Listed below are the top 10 names in the US according to
https://www.ssa.gov/oact/babynames/1NoahEmma2LiamOlivia3MasonSophia4JacobAva5Willia
mIsabella6EthanMia7JamesAbigail8AlexanderEmily9MichaelCharlotte10BenjaminHarper