Sorted order printing of a given array that represents a BST - Binary Search Tree - Given an array that stores a complete Binary Search Tree,
Category - Algorithm
Java Program Lowest Common Ancestor in a Binary Search Tree - Data Structure - write a c program to find the Lowest Common Ancestor (LCA).
open addressing is a method for handling collisions. In Open Addressing, all elements are stored in the hash table itself. So at any point, size of table
Since a hash function gets us a small number for a key which is a big integer or string, there is possibility that two keys result in same value.
Java program to check if a binary tree is BST or not - A binary search tree (BST) is a node based binary tree data structure.
we use arrays and keep the data sorted, then a phone number can be searched in O(Logn) time using Binary Search, but insert and delete operations
A Simple Solution is to consider every square submatrix and check whether is has all corner edges filled with ‘X’ and the time complexity of this solution.
Given a set of n nuts of different sizes and n bolts of different sizes. There is a one-one mapping between nuts and bolts.
In MS-Paint, when we take the brush to a pixel and click, the color of the region of that pixel is replaced with a new selected color.