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

print method for BinaryTree is based on recursion #104

Open
zrwusa opened this issue Oct 26, 2024 · 0 comments
Open

print method for BinaryTree is based on recursion #104

zrwusa opened this issue Oct 26, 2024 · 0 comments

Comments

@zrwusa
Copy link
Owner

zrwusa commented Oct 26, 2024

Describe the bug
The current print method for BinaryTree is based on recursion. An iterative implementation is necessary to avoid potential stack overflows.

To Reproduce
const bst = new BST()
for (let i = 1; i <= SYSTEM_MAX_CALL_STACK; i++) bst.add(i);
bst.print()
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
@zrwusa