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.

Sign up for GitHub

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

Jump to bottom

REQUEST: What is the time and space complexity of the algorithm to determine all array sequences that upon left to right traversal could generate the same BST #236

Open
RuchiInTheCloud opened this issue Jun 8, 2022 · 0 comments
Open

REQUEST: What is the time and space complexity of the algorithm to determine all array sequences that upon left to right traversal could generate the same BST #236

RuchiInTheCloud opened this issue Jun 8, 2022 · 0 comments

Comments

@RuchiInTheCloud
Copy link

RuchiInTheCloud commented Jun 8, 2022 •
edited
Loading

REQUEST: What is the time and space complexity of the algorithm to determine all array sequences that upon left to right traversal could generate the same BST? I am referring to the Solution to Question 9 in CTCI 6th Edition Book. I like to understand the complexity of this solution.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@RuchiInTheCloud