Given an N-ary tree, find the number of siblings of given node x. Assume that x exists in the given n-ary tree.
Input : 30 Output : 3
Approach : For every node in the given n-ary tree, push the children of the current node in the queue. While adding the children of current node in queue, check if any children is equal to the given value x or not. If yes, then return the number of siblings of x.
Below is the implementation of the above idea :
Time Complexity : O(N^2), where N is the number of nodes in tree.
Auxiliary Space : O(N), where N is the number of nodes in tree.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Check if two nodes in a Binary Tree are siblings
- Find the maximum GCD of the siblings of a Binary Tree
- Number of children of given node in n-ary Tree
- Number of turns to reach from one node to other in binary tree
- Print the number of set bits in each node of a Binary Tree
- Number of leaf nodes in the subtree of every node of an n-ary tree
- General Tree (Each node can have arbitrary number of children) Level Order Traversal
- Queries to find sum of distance of a given node to every leaf node in a Weighted Tree
- Find farthest node from each node in Tree
- Farthest distance of a Node from each Node of a Tree
- XOR of all the nodes in the sub-tree of the given node
- K-th ancestor of a node in Binary Tree | Set 3
- K-th ancestor of a node in Binary Tree
- Find the node at the centre of an N-ary tree
- Get Level of a node in a Binary Tree
- Sum of cousins of a given node in a Binary Tree
- Kth ancestor of a node in binary tree | Set 2
- Search a node in Binary Tree
- Node having maximum sum of immediate children and itself in n-ary tree
- Find root of the tree where children id sum for every node is given
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.