Climbing a (binary) Tree
In this post I will show how to transform a recursive depth first traversal function into an iterator for a binary tree
Author: marco.p.v.vezzoli
Stacking bits
I will show a very compact (memory efficient) and fast implementation of a binary stack, some Test Driven Design and success types
Prime Time
An introduction to coroutines, typestate machine, phantom types, iterators and ownership issues
Growing a (sorting) tree
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.
Git Separated Worktree
Git allows to have separate work tree and repo. This is handy in a number of situations
Python REPL
We are going to explore one of the most interesting feature of python: an interactive command line also known as REPL
Python Intro
how are values created in the source code of python, how to create basic expressions and use basic containers
Python Tutorial: a few built-in basic functions
when you start python some basic function are available which will be useful in next chapters