nihal-singh

/* Deleting a node from Binary search tree */
#include<iostream>
using namespace std;
struct Node {
	int data;
	struct Node *left;
	struct Node *right;
};
//Function to find minimum in a tree. 
Node* FindMin(Node* root)

nihal-singh

/* C++ program to find Inorder successor in a BST */
#include<iostream>
using namespace std;
struct Node {
	int data;
	struct Node *left;
	struct Node *right;
};

//Function to find some data in the tree

nihal-singh

class Solution {
    public int removeDuplicates(int[] nums) {
       int len = nums.length; // calculate length of the array.
        
        if(len == 0 || len == 1)return len; // return length if array has  zero or only one element.
        
        int lastMem =  nums[0]; // stores the element that is not duplicate
        int count = 1; //return count at last so as to get the unique element count
        int index = 1;  
      

nihal-singh

nihal-singh

nihal-singh

nihal-singh