* chore(CPlusPlus): add in-order predecessor and successor for bst
Delete in-order-Predecessor-and-successor.cpp
* Update tree structure in comments
update tree structure in comments to match the one which is being constructed
* chore(CPlusPlus): add avl tree
* Fix bugs
* update readme
* Update avl.cpp
* Update avl.cpp
* Update avl.cpp
Co-authored-by: Arsenic <54987647+Arsenic-ATG@users.noreply.github.com>
User can enter the number of nodes and the value for each note as desired with -1 for a NULL node. The program will build the tree and print out the traversal output.
Rahul Rajeev Pillai
Paramita Tejasvi
Arsenic