docs: Add more stuff

Author: 4ndrelim

src/main/java/algorithms/sorting/radixSort/README.md

@@ -76,3 +76,6 @@ like QuickSort or MergeSort for large datasets with a small range of key values
 might not be optimal on small datasets that include elements with a significantly higher number of digits compared to 
 others. This scenario could introduce more sorting passes than desired, diminishing the algorithm's overall efficiency.
   - Avoid for datasets with sparse data
+
+- Our implementation uses bit masking. If you are unsure, do check 
+[this](https://cheever.domains.swarthmore.edu/Ref/BinaryMath/NumSys.html ) out

src/main/java/dataStructures/avlTree/README.md

@@ -43,8 +43,9 @@ Consider any two nodes (need not have the same immediate parent node) in the tre
 between the two nodes <= 1 too?
 </details>
 
-It can be mathematically shown that a **height-balanced tree with n nodes, has at most height <= 2log(n)**. Therefore, 
-following the definition of a balanced tree, AVL trees are balanced.
+It can be mathematically shown that a **height-balanced tree with n nodes, has at most height <= 2log(n)** (
+in fact, using the golden ratio, we can achieve a tighter bound of ~1.44log(n)).
+Therefore, following the definition of a balanced tree, AVL trees are balanced.
 
 <div align="center">
     <img src="../../../../../docs/assets/images/AvlTree.png" width="40%">