# Tag: Search

Introduction This tutorial will check if a Binary Tree is Binary Search Tree or not. We know that a binary search tree (BST) is a node based binary tree data structure which satisfies the following properties: The left sub-tree of a node contains only nodes with keys less than the root node’s key. The right sub-tree…

Posted in Java

Finding start and end index of an element in a sorted array using Kotlin programming language will be shown here. The array may contain duplicate elements and we will see how to find a start and end index for an element in this array elements. We may design the algorithm for finding start and end…

Posted in Kotlin