By applying the binary search tree (BST) property, the nodes which would be visited when searching for 800 are 300, 900, 750.
<h3>What is a binary search?</h3>
Binary search can be defined as an efficient algorithm that is designed and developed for searching an element (information) from a sorted list of data, especially by using the run-time complexity of Ο(log n)
<u>Note:</u> n is the total number of elements.
<h3>What is a
binary search tree?</h3>
A binary search tree (BST) can be defined as a type of binary tree which has the ordering property that all the left subtree keys of a node are the node's key, and every keys of the right subtree are the node's key.
By applying the binary search tree (BST) property, we can infer and reasonably conclude that the nodes which would be visited when searching for 800 are 300, 900, 750.
Read more on binary search tree here: brainly.com/question/20217957
#SPJ4
