Recent posts
View all
Delete a node from BST
Node*inOrderSuccesor(Node*root) { Node*curr=root; while(curr && curr->left!=NULL) { curr=curr->left; } ret…
Read more
Lowest Common Ancestor in a Binary Tree
Node* lca(Node* root ,int n1 ,int n2 ) { if(root==NULL) { return NULL; } if(root->data==n1 || root-&g…
Read more
Longest Common Prefix in an Array || Remove duplicate element from sorted Linked List
Longest Common Prefix in an Array :- Given an array of N strings, find the longest common prefix among all strings present in the array. string …
Read more
Check for Balanced Tree || 3 approach
/** int height(struct Node* node){ if(node==NULL) { return 0; } int leftt=height(node->left); int rightt=he…
Read more
Social Plugin