Skip to content

Tag Archives: Binary Tree

Given an N-ary tree root, the task is to find the count of nodes such that their subtree is a binary tree. Example:Attention reader! Don’t… Read More
Graph colouring is the task of assigning colours to the vertices of a graph so that: pairs of adjacent vertices are assigned different colours, and… Read More
Given a Binary Tree, the task is to convert the given Binary Tree to the Symmetric Tree by adding the minimum number of nodes in… Read More
Given a Binary Tree, the task is to find the sum of leaf nodes at every level of the given tree. Examples:Attention reader! Don’t stop… Read More
Given a root of the Binary Tree and head of the Linked List, the task is to check if all the elements of the linked… Read More
Given a Binary Tree consisting of N nodes having no values in it and an integer X, that represents the value of the root node,… Read More
Given the root of a Complete Binary Tree consisting of N nodes, the task is to find the total number of nodes in the given… Read More
Given two arrays pre[] and in[] representing the preorder and inorder traversal of the binary tree, the task is to check if the given traversals… Read More
Given a binary tree, the task is to find all minimum values greater than or equal to zero, that should be added at each level… Read More
Given a Binary tree, the task is to trim this tree for any subtree containing only 0s. Examples:Attention reader! Don’t stop learning now. Get hold… Read More
Given an array pre[], representing the Preorder traversal of a Perfect Binary Tree consisting of N nodes, the task is to construct a Perfect Binary… Read More
Given a Binary Tree, the task is to print the Bottom-left to Upward-right Traversal of the given Binary Tree i.e., the level order traversal having… Read More
Given a binary tree, the task is to compress all the nodes on the same vertical line into a single node such that if the… Read More
Given an integer N, the task is to print all possible Full Binary Trees with N nodes. The value at the nodes does not contribute… Read More
Given two arrays, A[] and B[] consisting of M pairs, representing the edges of the two binary trees of N distinct nodes according to the… Read More

Start Your Coding Journey Now!