write a function that returns the size of the largest subtree which is also a Binary Search Tree (BST).
algorithm for binary search
Python Program – Find the node with minimum value in a Binary Search Tree – Just traverse the node from root to left recursively until left is NULL.
C++ Program Count 1’s in a sorted binary array – Searching and Sorting – A simple solution is to linearly traverse the array. The time complexity of the simple solution is O(n). We can use Binary Search to find count in O(Logn) time.
A Problem in Many Binary Search Implementations – Searching and Sorting – The above looks fine except one subtle thing, the expression “m = (l+r)/2”. It fails for large values of l and r. Specifically, it fails if the sum of low and high is greater than the maximum positive int value (231– 1).
Interpolation search vs Binary search – Searching and Sorting – On average the interpolation search makes about log(log(n)) comparisons(if the elements are uniformly distributed), where n is the number of elements to be searched.
TERNARY SEARCH – searching and sorting algorithm – The ternary search does less number of comparisons as it makes Log3n recursive calls, but binary search.
Binary Search – search and sorting – Search a sorted array by dividing the search interval in half. Begin with an interval covering the whole array.