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.
- Number of children of given node in n-ary Tree
- Number of leaf nodes in the subtree of every node of an 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
- General Tree (Each node can have arbitrary number of children) Level Order Traversal
- Node having maximum sum of immediate children and itself in n-ary tree
- Sum of cousins of a given node in a Binary Tree
- Search a node in Binary Tree
- Kth ancestor of a node in binary tree | Set 2
- Get Level of a node in a Binary Tree
- K-th ancestor of a node in Binary Tree
- Replace node with depth in a binary tree
- Get maximum left node in binary tree
- Right sibling of each node in a tree given as array of edges
- Find mirror of a given node in Binary tree