https://github.com/yantonov/clj-leftist-heap

pure functional implementation of leftist heap in clojure
https://github.com/yantonov/clj-leftist-heap

Last synced: 15 days ago
JSON representation

pure functional implementation of leftist heap in clojure

• Host: GitHub
• URL: https://github.com/yantonov/clj-leftist-heap
• Owner: yantonov
• Created: 2013-05-11T12:07:50.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2019-08-16T16:43:46.000Z (about 5 years ago)
• Last Synced: 2023-04-02T12:46:47.521Z (over 1 year ago)
• Language: Clojure
• Size: 5.86 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## clojure implementation of leftist heap

In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap.

This data structure allow you to extract minimal element, insert element with o(log(n)) speed like usual binary heap but also to merge two heaps in o(log(n)) time.

This repository contains purely functional implementation of leftist heap in clojure.

## License

Distributed under the Eclipse Public License, the same as Clojure.