Author: marco.p.v.vezzoli

creating a tree which works in embedded devices

In this post I will show how to transform a recursive depth first traversal function into an iterator for a binary tree

I will show a very compact (memory efficient) and fast implementation of a binary stack, some Test Driven Design and success types

An introduction to coroutines, typestate machine, phantom types, iterators and ownership issues

In this post we will extend our binary tree using generics and trait constraint, and add a simple sorting algorithm based on depth first traverse.