Python Algorithm – Next Greater Element – Stack – Given an array, print the Next Greater Element (NGE) for every element.
Coding
Latest Articles and Errors& Fixes fo popular programming languages like HTML,CSS, PHP, Javascript, Angularjs and more
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists.
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists.
An efficient solution based on hash map is discussed. We need to check the Horizontal Distances from root for all nodes and two nodes have the same
Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2[] is a subset of arr1[] or not. Both the arrays are not in sorted order.
Java Program Lowest Common Ancestor in a Binary Search Tree – Data Structure – write a c program to find the Lowest Common Ancestor (LCA).
An efficient solution based on hash map is discussed. We need to check the Horizontal Distances from root for all nodes and two nodes have the same.
Python Program – Lowest Common Ancestor in a Binary Search Tree – Data Structure – write a c program to find the Lowest Common Ancestor (LCA).
C Program Lowest Common Ancestor in a Binary Search Tree – Data Structure – write a c program to find the Lowest Common Ancestor (LCA).
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.