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

AVL Tree #127

Open
0xCourtney opened this issue Jul 25, 2022 · 0 comments
Open

AVL Tree #127

0xCourtney opened this issue Jul 25, 2022 · 0 comments

Comments

@0xCourtney
Copy link
Contributor

The AVL tree is a data structure that is efficiently sorted upon insertion and removal of nodes. This may be useful for DeFi data structures where 1) data must be ordered at all times 2) the cost of sorting the data structure should be amortized across user interactions. The AVL Tree should have a generalized implementation.
@0xCourtney 0xCourtney self-assigned this Jul 25, 2022
@ItsNickBarry ItsNickBarry mentioned this issue Jul 25, 2022
Closed
@0xCourtney 0xCourtney removed their assignment Oct 8, 2022
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
@0xCourtney