Algorithms for the Masses by Julian M Bucknall

I write a monthly column for PCPlus, a computer news-views-n-reviews magazine in the UK (actually there are 13 issues a year — there's an Xmas issue as well — so it's a bit more than monthly). The column is called Theory Workshop and appears in the back of every issue. When I signed up, my editor and the magazine were gracious enough to allow me to reprint the articles here after say a year or so. After all, the PDFs do appear on each issue's DVD after a couple of months. When I buy the current issue, I'll publish the article from the issue a year ago. Since I've just bought the issue for June 2009, here's June 2008's article.

I confess this was a quick article to write. I'd already done a great deal of research on drawing binary trees for a series of blog posts I was writing about red-black trees on my old blog, so it was just a case of recasting what I'd already written into the PCPlus "style" and creating a set of new images.

The red-black tree posts I'd been writing at the time are here: 1, 2, 3, 4, 5, 5 bis.

This article first appeared in issue 269, June 2008.

You can download the PDF here.

Posts on similar topics...

• PCPlus 271: Binary heaps
• PCPlus 268: Drawing Bézier curves
• PCPlus 273: Solitaire cryptography