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.
73 posts tagged with "techstuff"
View All TagsExpression Trees – Infix to Postfix
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.
Binary Search Tree
Hi, I thought I would do something about binary search trees.
OOP - Build a Filesystem with the „Composite Pattern“
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.
What are Graphs? – Part 7 Dijkstra
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.
U = R * I – A little Intro
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.
What are Graphs? – Part 5 Prim
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.
What are Graphs? - Part 6 Kruskal
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.
OOP - Observer-Pattern
The Observer pattern, is a design pattern from Object Oriented Programming. This pattern is intended to make things easier for us.
What are Graphs? – Part 3 DFS
Hi, in the third part of my graph series, I want to talk about the search algorithms. We have programmed the graph in Python in the second part. Now it goes to the search algorithms. Each search algorithm will be discussed in separate posts.