Print all nodes that don't have sibling gfg || 6 May 2024

#potd #gfg #geeksforgeeks
#potd #gfg #geeksforgeeks #code #coding #problemsolving #potdgfg
#code #programming #algorithm #datastructures #graph

geeks for geeks potd
Print all nodes that don't have sibling
gfg podt solution Print all nodes that don't have sibling
geeks for geeks problem of the day solution with explanation
Print all nodes that don't have sibling algorithms
Print all nodes that don't have sibling gfg potd
Print all nodes that don't have sibling gfg problem of the day
Print all nodes that don't have sibling gfg
Print all nodes that don't have sibling potd geeks for geeks
Print all nodes that don't have sibling problem of the day gfg
Print all nodes that don't have sibling algorithm
Print all nodes that don't have sibling algorithms solution
Print all nodes that don't have sibling problem potd today
Print all nodes that don't have sibling full explanation

6 May problem of the day

how to solve gfg potd
how to solve problem of the day geeks for geeks
gfg potd todays problem solution explanation
solution of gfg todays problem
soluton of potd gfg
solution of problem of the day gfg
problem of the day geeks for geeks solution of todays problem
today potd gfg problem solution
today gfg potd problem solution explained in java programming language
gfg potd problem solution in java programming language explained
gfg potd solution today

solve today potd gfg problem
challenge me at gfg potd
solve potd gfg
gfg potd problems solutions
gfg potd hard
gfg potd easy
gfg potd hard problem
gfg potd medium problem
gfg potd easy problem
geeks for geeks problem of the day easy problem
geeks for geeks problem of the day medium problem
geeks for geeks problem of the day hard problem

code language used c++
code explained in c++
code writing in c++
know more about c++
shortcut in c++
c++ code gfg potd solution
java, c++ python gfg potd solution
python potd gfg solution

[SCODESam]

code -->
void solve(Node* root, vector<int>&ans){
if(root==NULL)return;
// 1-case
if(root->left==NULL && root->right==NULL)return;
//2-case
else if(root->left!=NULL && root->right!=NULL){
solve(root->left, ans);
solve(root->right, ans);
}
// 3- case
else if(root->left!=NULL && root->right ==NULL){

solve(root->left, ans);
}
// 4-case
else if(root->left==NULL && root->right!=NULL){

solve(root->right, ans);
}
}
vector<int> noSibling(Node* node)
{
// code here
vector<int>ans;
solve(node, ans);
sort(ans.begin(), ans.end());
if(ans.size()==0)return {-1};
return ans;
}