Skip to content
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

Explanation to Finding Minimum and Maximum Value in a Binary Search Tree #55

Open
1 of 4 tasks
arkayyy opened this issue Oct 1, 2021 · 1 comment
Open
1 of 4 tasks
Assignees
Labels
assigned Hacktoberfest pr's or issues under hacktoberfest

Comments

@arkayyy
Copy link

arkayyy commented Oct 1, 2021

Description

I would like to add a conceptual question along with explanation, for finding the minimum and maximum value in a Binary Search Tree using recursive methods.

Programming language

  • C
  • C++
  • Java
  • Python

Are you contributing under any open-source program ?

Hacktoberfest 2021


@arkayyy
Copy link
Author

arkayyy commented Oct 2, 2021

@girija0707 @siddhi-244 Please consider assigning this to me under hacktoberfest 2021 tag.

@siddhi-244 siddhi-244 added assigned Hacktoberfest pr's or issues under hacktoberfest labels Oct 3, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
assigned Hacktoberfest pr's or issues under hacktoberfest
Projects
None yet
Development

No branches or pull requests

2 participants