Binary Search Trees in Computer Programming

This book has been written with the purpose of teaching students and schoolchildren interested in acquiring programming skills the fundamentals of algorithms design and analysis. I hope that my work would be able to lay a foundation for a series of interesting and helpful textbooks in computer science, where every topic would be considered both as detailed as possible and in understandable terms. In this book, the material described is what’s being taught for sophomores at universities, but many schoolchildren going to graduate from school and become students will also be able to read and understand the text, since the discussion typically doesn’t apply to anything beyond school algebra, and where more difficult mathematical concepts need to be explained, they will be explained in place, without any necessity to open summaries of lectures in higher mathematics. The only precondition for readers would be to be able to think logically, be able to formalize problems and knowledge of fundamental concepts of procedural programming that nowadays nearly every senior pupil at school is aware of.

In my view, the task of a book in computer science is not to frighten future programmers, but to become their companion in getting necessary knowledge. I believe that if a young person is aspired to become a talented and proficient computer programmer, they shouldn’t encounter textbooks written in hieroglyphs. I believe that a textbook devoted to algorithm design and analysis can and should be written so that even schoolchildren and students may understand its content without any necessity to apply to someone’s help for additional explanations and clarifications. I sincerely hope that I was able to write a book like this.