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

[NEW ALGORITHM] Conversion of Linked List to Balanced Binary Search Tree #1809

Closed
2 tasks done
aditiverma-21 opened this issue Nov 9, 2024 · 1 comment
Closed
2 tasks done

[NEW ALGORITHM] Conversion of Linked List to Balanced Binary Search Tree #1809

aditiverma-21 opened this issue Nov 9, 2024 · 1 comment
Assignees
@aditiverma-21
Labels
gssoc-ext level1 new algorithm

Comments

@aditiverma-21
Copy link
Contributor

Convert Linked List to Balanced Binary Search Tree

Description: Given a sorted linked list, convert it into a balanced binary search tree.

Potential Use Case: Useful for converting sequentially sorted data into a tree format for faster access in search-related applications.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level2

Assignees:

  • Contributor in GSSoC-ext
  • Want to work on it
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@aditiverma-21 aditiverma-21

Labels
gssoc-ext level1 new algorithm
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@pankaj-bind @aditiverma-21