https://github.com/davecom/swiftredblacktree

A Red-Black Tree Implemented in Swift
https://github.com/davecom/swiftredblacktree

balanced-binary-search-trees balanced-search-trees binary-search-tree binary-search-trees binary-trees red-black-tree red-black-trees

Last synced: 4 months ago
JSON representation

A Red-Black Tree Implemented in Swift

• Host: GitHub
• URL: https://github.com/davecom/swiftredblacktree
• Owner: davecom
• License: mit
• Created: 2017-11-11T20:50:35.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2017-11-11T21:46:16.000Z (over 7 years ago)
• Last Synced: 2025-01-09T09:52:54.714Z (6 months ago)
• Topics: balanced-binary-search-trees, balanced-search-trees, binary-search-tree, binary-search-trees, binary-trees, red-black-tree, red-black-trees
• Language: Swift
• Size: 9.77 KB
• Stars: 2
• Watchers: 3
• Forks: 0
• Open Issues: 3
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# SwiftRedBlackTree

This is a simple red-black tree implementation. Currently it is a port of the Java code from section 3.3 of Algorithms, 4th Edition, by Sedgewick and Wayne. You can find the original implementation [here](https://algs4.cs.princeton.edu/33balanced/RedBlackBST.java.html).