Programming Algorithms in Lisp: Writing Efficient Programs with Examples in ANSI Common Lisp

© Vsevolod Domkin 2021

V. DomkinProgramming Algorithms in Lisphttps://doi.org/10.1007/978-1-4842-6428-7_9

9. Trees

Vsevolod Domkin¹  

(1)

Kyiv, Ukraine

 

Balancing a binary tree is the infamous interview problem that has all that folklore and debate associated with it. To tell you the truth, like the other 99% of programmers, I never had to perform this task for some work-related project. And not even due to the existence of ready-made libraries, but because self-balancing binary trees are, actually, pretty rarely used. But trees, in general, are ubiquitous even if you may not recognize their presence. The source code we operate with, at some stage of ...