https://github.com/gyuho/llrb

Package llrb implements left-leaning Red-Black tree.
https://github.com/gyuho/llrb

Last synced: about 2 months ago
JSON representation

Package llrb implements left-leaning Red-Black tree.

• Host: GitHub
• URL: https://github.com/gyuho/llrb
• Owner: gyuho
• License: apache-2.0
• Created: 2016-03-27T20:18:43.000Z (over 8 years ago)
• Default Branch: master
• Last Pushed: 2017-10-01T06:07:11.000Z (about 7 years ago)
• Last Synced: 2024-06-20T03:31:32.425Z (6 months ago)
• Language: Go
• Size: 19.5 KB
• Stars: 5
• Watchers: 1
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
## llrb [![Go Report Card](https://goreportcard.com/badge/github.com/gyuho/llrb?style=flat-square)](https://goreportcard.com/report/github.com/gyuho/llrb) [![Build Status](https://img.shields.io/travis/gyuho/llrb.svg?style=flat-square)](https://travis-ci.org/gyuho/llrb) [![Godoc](https://img.shields.io/badge/godoc-documentation-blue.svg?style=flat-square)](https://godoc.org/github.com/gyuho/llrb)

Package llrb implements left-leaning Red-Black tree.




I have tutorials and visualizations of graph, tree algorithms:

- [**_Binary search tree_**](https://github.com/gyuho/learn/tree/master/doc/binary_search_tree)

- [**_Go: heap, priority queue_**](https://github.com/gyuho/learn/tree/master/doc/go_heap_priority_queue)

- [**_Go: red black tree_**](https://github.com/gyuho/learn/tree/master/doc/go_red_black_tree)

- [**_Go: b-tree_**](https://github.com/gyuho/learn/tree/master/doc/go_b_tree)

- [**_Go: graph, interface_**](https://github.com/gyuho/learn/tree/master/doc/go_graph_interface)

- [**_Go: graph, traversal_**](https://github.com/gyuho/learn/tree/master/doc/go_graph_traversal)

- [**_Go: graph, shortest path_**](https://github.com/gyuho/learn/tree/master/doc/go_graph_shortest_path)

- [**_Go: graph, topological sort_**](https://github.com/gyuho/learn/tree/master/doc/go_graph_topological_sort)

- [**_Go: graph, minimum spanning tree_**](https://github.com/gyuho/learn/tree/master/doc/go_graph_minimum_spanning_tree)

- [**_Go: graph, strongly connected components_**](https://github.com/gyuho/learn/tree/master/doc/go_graph_strongly_connected_components)




For fast query and retrieval, please check out  Cayley.






- Please visit my YouTube Channel

- `Tree`, `Graph` Theory Algorithms (Playlist)

- `Graph` : BFS, DFS