binary search tree is an example of
Welcome to the solution site, which is interested in answering educational questions, as it provides an wanser to your questions in all areas
The solution site is concerned with questions, answers and solutions for all study materials for all levels
Through the word “Ask a Question” at the top of the site, you can ask any topic or any question or inquiry you want answered by users specialized
to solving questions and educational and academic activities that you ask
Now let’s answer your question
binary search tree is an example of
answer :A Binary Search Tree (BST) is a tree in which all the nodes follow the below-mentioned properties − The value of the key of the left sub-tree is less than the value of its parent (root) node’s key. The value of the key of the right sub-tree is greater than or equal to the value of its parent (root) node’s key.