In order Successor in Binary Search Tree – Binary Search Tree – In order successor of a node is the next node in In order traversal of the Binary Tree.
Algorithm
263 Articles
263
C Program – In order Successor in Binary Search Tree – Binary Search Tree – In order Successor is NULL for the last node in In order traversal.
Python Program – In order Successor in Binary Search Tree – Binary Search Tree – In order Successor is NULL for the last node in In order traversal.
Delete a node in a Doubly Linked List – Doubly Linked List – If node to be deleted is head node, then change the head pointer to next current head.
find largest multiple 3 – Given an array of non-negative integers. Find the largest multiple of 3 that can be formed from array elements.
C Algorithm – The Stock Span Problem – Stack – The stock span problem is a financial problem where we have a series of n daily price quotes
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists.
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.
Sorted order printing of a given array that represents a BST – Binary Search Tree – Given an array that stores a complete Binary Search Tree,
Java Program Lowest Common Ancestor in a Binary Search Tree – Data Structure – write a c program to find the Lowest Common Ancestor (LCA).