K-th smallest Element in BST

[jay24rajput]

Problem Statement

Adding a function to the BST to find the kth-smallest element in the entire binary search tree. If possible I would also like to extend it to find the kth-largest element in the BST.

Motivation

This problem was asked in Leetcode Challenge. I thought that this will be a good addition( if not absolutely necessary) to the BST functions.

[jay24rajput]

@cclauss thoughts?

[jay24rajput]

@Gaushikmr I was kind of hoping to work on it myself once @cclauss or any other mentor approves the functions

[cclauss]

Please do not open issues to ask permission or be to assigned. Those are both alien concepts in this repo.

We review pull requests. If you have a good idea then implement it and submit a pull request. If you both submit pull requests on the same algorithm, we might pick one and close the other. Or more likely, we might ask you to work together to create a unified pull request that takes the strengths of each request.

Only our competitors think that we should wait...

[jay24rajput]

Thanks for the reply! I will issue a PR soon

[cclauss]

It would also help readers if you could provide a use case.
When and why would I want to find the k-th smallest element in a binary search tree.

[stale]

This issue 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.

[Gaushikmr]

@jay24rajput R u working on this issue.if not I can work on it

[jay24rajput]

@Gaushikmr Please go ahead 👍

[Gaushikmr]

@jay24rajput OK

[SiddhantBobde]

Can I work on this issue?

[cclauss]

PLEASE do not ask permission to work on a problem. This repo does not reserve tasks or give permission. If you see something that should be fixed then please submit a pull request and it will be evaluated on its merits. Having two developers submit alternative solutions to a problem is much better than having developers waiting for permission to start working.