Hi, in the second part of my tree series, I want to talk about rotations. In the first part, we learned what binary search trees are.

Hi, today I'm going to do something with expression trees. An expression tree, is a binary search tree, with which one can represent arithmetic expressions. Here each node is either an operator or a number.

Linux is a multi-user system. Here, several users can work on the system simultaneously. Where are the users stored?

Hi, I thought I would do something about binary search trees.

Intro​

Who does not know the series, Mr Robot. In the series, when Elliot had played CTF with, I thought to myself, I must do sometime also. A year later, so today, because I had a lot around the ears, I come only now to play times CTF 😄

Hi, I have bock to tinker a small file system. A filesystem is in the end, a tree. Normally a B-tree or a (B+)-tree is used to realize a filesystem. I thought why not make the whole thing OOP.

Hi, in the seventh and last part of my graph series, I want to talk about Dijkstra's algorithm. We have programmed Kruskal in Python in the sixth part. Now it's time to move on to Dijkstra.

Hi, I had thought, since I had done nothing with electronics for a long time, to make a small post about the basics of electrical engineering.

Hi, in the fifth part of my graph series, I want to talk about the Prim algorithm. In the fourth part, we programmed the breadth-first search in Python.

Hi, in the sixth part of my graph series, I want to talk about the Kruskal algorithm. We have programmed Prim in Python in the fifth part. Now it's time for Kruskal.