Improve basic_binary_tree.py

[harshitkap00r]

Adding Preorder traversal and Postorder traversal function. Change the name of function according to above point.

Describe your change:

• [x] Add an algorithm?
• [ ] Fix a bug or typo in an existing algorithm?
• [ ] Documentation change?

Checklist:

• [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.
• [ ] All new Python files are placed inside an existing directory.
• [ ] All filenames are in all lowercase characters with no spaces or dashes.
• [ ] All functions and variable names follow Python naming conventions.
• [ ] 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 have a URL in its comments that points to Wikipedia or other similar explanation.
• [x] If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

[stale[bot]]

This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[cclauss]

In preparation for that denial-of-service attack that is Hacktoberfest, I am closing all pull requests that have failing tests.

[abhijitgawai]

This pr can be merged. Seems correct

[cclauss]

@abhijitgawai Please read items 1 and 3 which are checked in the checklist in the commit message above.