Bhavesh9908/Building a KD-Tree from Points

[x] ### Describe your change: This function constructs a KD-Tree from a list of points in a multi-dimensional space. The KD-Tree is a binary tree used for partitioning space in a way that allows efficient querying, such as nearest neighbor searches.
- [x] Add an algorithm?
[ ] Fix a bug or typo in an existing algorithm?
[ ] Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
[ ] Documentation change?

[x] I have read CONTRIBUTING.md.
[x] This pull request is all my own work -- I have not plagiarized.
[x] I know that pull requests will not be merged if they fail the automated tests.
[x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
[x] All new Python files are placed inside an existing directory.
[x] All filenames are in all lowercase characters with no spaces or dashes.
[x] All functions and variable names follow Python naming conventions.
[x] All function parameters and return values are annotated with Python type hints.
[x] All functions have doctests that pass the automated testing.
[x] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
[ ] If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

TheAlgorithms / Python