Not able to find te problem in the code ..testcase is notrunning

#1
#2

@3lokesharora hey lokesh there is no rocket science in this question the tree input is in sorted form make a recursive function and the same algorithm as binary search used here calculate mid and the node value which is smaller than mid send them to left else send them the right.

#3

I have used the concept of avl trees …I am doing balancing at each step …Just tell what is the problem in this method . Sample test case is running …But other test case is not running …

#4

@3lokesharora hey lokesh the logic of building a binary search tree is same as I suggested so why do you want to use avl tree

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.