change name in links from sebastianoner (old) to ossner (new)

README.md

@@ -39,10 +39,10 @@ to your [PATH](https://tex.stackexchange.com/questions/60702/setting-up-miktex-a
 Please note: For now, the exercise generator is optimized for IDE, if you want to use it in your command line, you will likely
 have to make some small adjustments.
 
-Visit [sebastianoner.github.io/TUMGAD](https://sebastianoner.github.io/TUMGAD)
+Visit [ossner.github.io/TUMGAD/](https://ossner.github.io/TUMGAD/src/routes)
 ## Contributing
-If you spot an issue you can report it [here](https://github.com/SebastianOner/TUMGAD/issues/new?assignees=&labels=&template=bug_report.md&title=)
+If you spot an issue you can report it [here](https://github.com/ossner/TUMGAD/issues/new?assignees=&labels=&template=bug_report.md&title=)
 
-If you have an idea for a feature you can submit it [here](https://github.com/SebastianOner/TUMGAD/issues/new?assignees=&labels=&template=feature_request.md&title=)
+If you have an idea for a feature you can submit it [here](https://github.com/ossner/TUMGAD/issues/new?assignees=&labels=&template=feature_request.md&title=)
 
 Or just submit a pull request if you're familiar with GitHub. Contributing guidelines can be found [here](CONTRIBUTING.md)

src/DataStructures/PriorityQueues/BinomialHeaps/BinomialHeaps.md

@@ -50,7 +50,7 @@ After inserting a value (say 8) we get our new heap:
 ![Adding a value to a heap like this is the simplest insertion](../../../../resources/BinomialHeapInsertionEasyExampleAfter.png)
 
 If the inserted value has a higher priority than our min node, the pointer
-(see [deletion](https://sebastianoner.github.io/TUMGAD/src/DataStructures/PriorityQueues/BinomialHeaps/BinomialHeaps#removing-the-highest-priority-node))
+(see [deletion](https://ossner.github.io/TUMGAD/src/DataStructures/PriorityQueues/BinomialHeaps/BinomialHeaps#removing-the-highest-priority-node))
 
 This is by far the simplest insertion there can be. However, it is not always
 the case (obviously) because if there is another tree in the heap with height