@sivarajans/self-balancing-binary-tree v1.0.4

AVL - Self Balanced Tree

It is a binary tree that is balanced automatically when node insertion or removal takes place.

Valid balance factors are -1, 0, 1

Balance Factor (BF) = Height Of Right Side - Height of Left Side.

Below example follows below rules. 1. valid left child - less than parent node 2. valid right child - higher than parent node

npm i @sivarajans/self-balancing-binary-tree