Sorted order printing of a given array that represents a BST – Binary Search Tree – Given an array that stores a complete Binary Search Tree,
binary search tree in data structure
5 Articles
5
python Programming Inorder predecessor and successor for a given key in BST – I recently encountered with a question in an interview at e-commerce company.
PYTHON Programming-Merge Sort for Doubly Linked List – Searching and Sorting – Merge sort for singly linked list is already discussed. The important change here is to modify the previous pointers also when merging two lists.
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).
Binary Search – search and sorting – Search a sorted array by dividing the search interval in half. Begin with an interval covering the whole array.