Tag Archives: LCA

Maximum element between two nodes of BST

Given an array of N elements and two integers A, B which belongs to the given array. Create a Binary Search Tree by inserting element from arr[0] to arr[n-1]. The task is to find the maximum element in the path from A to B. Examples: Input : arr[] = { 18, 36, 9, 6, 12,… Read More »