[Feature] Add Notes on Binary Search Trees

[visheshrwl]

** Hacktoberfest Label: Yes**

Description:
BSTs are fundamental data structures in computer science and are widely used. High-quality notes on this topic will greatly benefit the community.

Scope: This feature request involves adding detailed notes about Binary Search Trees.

Suggested Implementation:

• Create a new directory named "Binary Search Trees."

• Inside the directory, add well-structured notes in Markdown format.

• Include explanations, visual representations, and code examples.

• Ensure clarity and simplicity in explanations.

• Create a README.md in the directory that provides an overview and links to individual notes.

Contribution Guidelines:

• Please follow the repository's contribution guidelines, including coding style, licensing, and formatting instructions.

• Ensure that your contributions are your original work or properly attributed to their sources.

Expected Outcome:

• The repository should contain high-quality notes on Binary Search Trees by the end of Hacktoberfest, making it an excellent resource for learners and developers.

Additional Information:
Please reach out if you have any questions or need guidance while contributing to this issue.

Hacktoberfest: This issue is tagged for Hacktoberfest.