Binary Tree or how to prepare a binary search tree
Prelude This article is dedicated to binary search trees. Recently, I wrote an article about data compression using Huffman coding. At that time, I didn't focus on binary trees since the methods for searching, inserting, and deleting weren't relevant. Now, I've decided to write specifically about trees. So let's begin. A tree is a data structure made up of nodes connected by edges. You could say that a tree is […]
