Balanced Binary Tree in Python

Before talking about the height balanced binary tree, let’s understand what exactly is meant by the height of the binary tree.

Height of a binary tree = Count of edges between the root node and the farthest node

A height balanced Binary Tree has the following properties ::

In programming how we pronounce something in mind may lead to different results. Just for an example:

may lead to 2 different thoughts in the mind of a programmer thinking of writing an objected oriented code for the problem.

I decided to go with point #2 which says that Tree is nothing but Nodes connected together. So at least for this article, we’re going to write code based on that assumption. ( feel free to comment if you think otherwise, I’m open to change )

Now let’s build some classes !!

I planned to name the class NodeTree and it has 3 attributes viz value, right and left. Value is the value of the current node and right, left corresponds to the right and left sub-trees.

Think of this class as an equivalent of a measuring tape or any measuring apparatus in general which takes the object and performs some calculations on it.

Combining all the classes together and testing whether the pieces work together in harmony or not.

Related posts:

Benar sudah Allah tentukan tujuan penciptaan manusia, diantaranya: (1) beribadah (2) menjadi pemimpin di bumi (3) menjadi bermanfaat bagi yg lainnya. Identifikasi titik-titik di luar kendali manusia…

We are more than proud to announce that our Intrachain Token Sale will start today on December 3rd!!! Today we want to give you all the information on our token sale. Let’s start looking at our…

Silence is the MOST underrated thing in the world. Imagine being able to get away from your busy life, falling into a sweet haze. That’s basically silence (unless it’s awkward, that’s basically a…