Skip to content

Tag Archives: n-ary-tree

Given an element x, task is to find the value of its immediate smaller element.  Example :  Input : x = 30 (for above tree)… Read More
Given an N-ary tree, find sum of all elements in it. Example :  Input : Above tree Output : Sum is 536 Recommended: Please try… Read More
We are given a tree of size n as array parent[0..n-1] where every index i in the parent[] represents a node and the value at… Read More
N-ary tree refers to the rooted tree in which each node having atmost k child nodes. The diameter of n-ary tree is the longest path… Read More
Given a n-ary tree and a number x, find and return the number of nodes which are greater than x.  Example:  In the given tree,… Read More
Given a generic tree and a integer x. Find and return the node with next larger element in the tree i.e. find a node just… Read More
Given an N-ary tree, find and return the node with second largest value in the given tree. Return NULL if no node with required value… Read More
Given an N-Ary tree, find and return the node for which sum of data of all children and the node itself is maximum. In the… Read More
Given a N-ary tree represented as adjacency list, we need to write a program to count all such nodes in this tree which has more… Read More
Given a generic tree, perform a Level order traversal and print all of its nodes Examples:  Input : 10 / / \ \ 2 34… Read More
A tree consisting of n nodes is given, we need to print its DFS. Examples :  Input : Edges of graph 1 2 1 3… Read More
Given a parent array P, where P[i] indicates the parent of the ith node in the tree(assume parent of root node id indicated with -1).… Read More
Given an array that contains the preorder traversal of the full k-ary tree, construct the full k-ary tree and print its postorder traversal. A full… Read More
Given two n-ary trees, the task is to check if they are the mirror of each other or not. Print “Yes” if they are the… Read More
Left-Child Right-Sibling Representation is a different representation of an n-ary tree where instead of holding a reference to each and every child node, a node… Read More