need to traverse the entire tree at every nodewe get hint regarding which sub-tree to search in for examplein the given treeif we have to search for then we know that we have to scan only the left sub-tree if the value is present in the treeit will only be in the left sub-treeas is smaller than (the root node' valuethe left sub-tree has root node with the value since is greater than we will move to the right sub-treewhere we will find the element thusthe average running time of search operation is (log )as at every stepwe eliminate half of the sub-tree from the search process due to its efficiency in searching elementsbinary search trees are widely used in dictionary problems where the code always inserts and searches the elements that are indexed by some key value binary search trees also speed up the insertion and deletion operations the tree has speed advantage when the data in the structure changes rapidly binary search trees are considered to be efficient data structures especially when compared with sorted linear arrays and linked lists in sorted arraysearching can be done in (log ntimebut insertions and deletions are quite expensive in contrastinserting and deleting elements in linked list is easierbut searching for an element is done in (ntime howeverin the worst casea binary search tree will take (ntime to search for an element the worst case would occur when the tree is linear chain of nodes as given in fig to summarizea binary search tree is binary tree with the following propertiesthe left sub-tree of node contains values that are less than ' value ( (athe right sub-tree of node contains values that are greater figure (aleft skewedand (bthan ' value right skewed binary both the left and the right binary trees also satisfy these search trees properties andthusare binary search trees example solution state whether the binary trees in fig are binary search trees or not (no (yes (no figure binary trees example create binary search tree using the following data elements solution (step (step (step (step (step (step (step (step