BST Search Artefact

The goal of this artefact is to thouroughly understand the algorithm involved in searching for an element in BST
Starting from the root of the tree, you have to predict if the pointer will go to the right or the left child of the node at each step.
Click on Right to go Right and Left to go Left
Once you have found the node correctly,click Verify to verify and then you can click on Next to practise another problem.