https://github.com/leiless/avltree

An ANSI bottom-up AVL tree implementation
https://github.com/leiless/avltree

Last synced: over 1 year ago
JSON representation

An ANSI bottom-up AVL tree implementation

• Host: GitHub
• URL: https://github.com/leiless/avltree
• Owner: leiless
• License: bsd-2-clause
• Created: 2018-05-12T03:55:06.000Z (about 8 years ago)
• Default Branch: master
• Last Pushed: 2018-05-12T06:44:37.000Z (about 8 years ago)
• Last Synced: 2025-03-15T00:39:52.935Z (over 1 year ago)
• Language: C
• Size: 5.86 KB
• Stars: 1
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README
  • License: LICENSE

Awesome Lists containing this project

README

          
An ANSI bottom-up AVL tree implementation

Since its bottom-up property  the insertion/deletion speed in proportion to the tree size, which should be slow

TODO

* use top-down manner

* give a simple usage example in README

* write a reasonable Makefile

* (test) use valgrind to detect memleak

* use src/test directory hierarchy