superb sundeep, when ever i open you tube or feel like free unconditionally open your tutorial. nice and keep it up!!
@smiletripathi38392 жыл бұрын
Very good detailed explanation.I couldn't find anywhere else.
@sushanthmindi90415 жыл бұрын
Sir we are following your channel day to day... So please upload remaining types of trees like avl tree.... Etc. Because we have tcs exam on 3rd aug..u r the only saviour....so Please upload them as soon as possible!!
@vazeerrakeshrao58695 жыл бұрын
Hai are you qualified in tcs ecam
@vasantprabhu3 жыл бұрын
what is the use of the return keyword in the else if and the else parts? cant we simply call search(root->left,key) or search(root->right,key) ?
@shiva-bg6ve5 жыл бұрын
Superb sir
@volipianusha94254 жыл бұрын
Sir please explain about OBST...
@Mathworld12692 ай бұрын
Where can i implement this code
@AdarshKashyap_5 жыл бұрын
Please make a video on Searching and sorting video sir
@shiva-bg6ve5 жыл бұрын
Sir u didn't gave logic for insertion and deletion of bst plz video sir
@aniketrajapure82512 жыл бұрын
Thank You sir
@alongwith_Ashu2 жыл бұрын
Xam savior sir miru
@allinone-bb7rq4 жыл бұрын
Thank you Soo muchhh
@its_me_dharanisree66794 жыл бұрын
Sir plz post veiod for additional binary tree and avl deletion