We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c5ff408 commit 0f2e9e1Copy full SHA for 0f2e9e1
AVL Tree/README.markdown
@@ -88,4 +88,4 @@ The interesting bits are in the `balance()` method which is called after inserti
88
89
AVL tree was the first self-balancing binary tree. These days, the [red-black tree](../Red-Black%20Tree/) seems to be more popular.
90
91
-*Written for Swift Algorithm Club by Mike Taghavi and Matthijs Hollemans*
+*Written for Swift Algorithm Club by [Mike Taghavi](https://github.com/mitghi) and [Matthijs Hollemans](https://github.com/hollance)*
0 commit comments