This function takes in the index and calculates the height of the node
This function is an iterative function as we might have to subtract the largest left_most tree.
This function takes in the index and calculates if the node is the right child node or not.
If the node is the tree root it will still give the answer as if it is a child of a node.
This function is an iterative function as we might have to subtract the largest left_most tree.
This function takes in the index and calculates the index of the sibling.