Check fro bst issue

#1

what is the time complexity of the function implemented in the video?

#2

Hey @Rj.25
The time complexity of the function implemented in the video is O(n) where n is the no. of vertices in the tree. This is so because we go on each vertex only once.

#3

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.