-
-
Notifications
You must be signed in to change notification settings - Fork 46.8k
Added function for finding K-th smallest element in BST #2318
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
Hey @SiddhantBobde, TravisCI finished with status TravisBuddy Request Identifier: 9f4c1180-dfa2-11ea-a7d8-3d177b5d5f1d |
These can be fixed very easily. |
yes |
please review my pull request. |
…s#2318) * fixes: TheAlgorithms#2172 * fixes: TheAlgorithms#2172 * Added docstrings and type of parameters * fixed error * Added type hints * made changes * removed capital letters from function name * Added type hints * fixed bulid error * modified comments * fixed build error
Describe your change:
#2172 fixed
Added function inorder and find_kth_smallest in Python\data_structures\binary_tree\binary_search_tree.py
Checklist:
Fixes: #{$ISSUE_NO}
.