Commit ee5df3b

authored

Updated date and added reference to Red-Black Tree

1 parent c5a41ec commit ee5df3bCopy full SHA for ee5df3b

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`[![Language](https://img.shields.io/badge/language-swift-orange.svg)]()`
`2`	`2`	`[![License](https://img.shields.io/badge/license-MIT-blue.svg)]()`
`3`	`3`
`4`		`-Last Update: 12/August/2018.`
	`4`	`+Last Update: 13/August/2018.`
`5`	`5`
`6`	`6`	`# interviz`
`7`	`7`	This is a `playground-based` project that contains examples of common `Algorithms` and `Data Structures` implemented using the latest stable version of `Swift`programming language. The development attempts to fully utilize `Standard Library` and `Protocol-Oriented` paradigm. The project provides interactive visualizations using `SpriteKit` and `SceneKit` frameworks (in development). The name`interviz` stands for `interactive visualization` which is one of purposes of this project - to provide a UI interface for common algorithms and data structures.
@@ -24,7 +24,7 @@ Each major section will be wrapped into a separete `.playground` file, meaning t
`24`	`24`	`- [Binary Search Tree](https://github.com/jVirus/interviz/blob/master/Data%20Structures.playground/Pages/BinarySearchTree.xcplaygroundpage/Contents.swift)`
`25`	`25`	`- B-Tree`
`26`	`26`	`- Splay Tree`
`27`		`- - Red-Black Tree`
	`27`	`+ - [Red-Black Tree](https://github.com/jVirus/interviz/blob/master/Data%20Structures.playground/Pages/Red-Black%20Tree.xcplaygroundpage/Contents.swift)`
`28`	`28`	`- AVL Tree`
`29`	`29`	`- Trie Tree`
`30`	`30`	`- Radix Tree`

Comments

(0)