Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles by Sunidhi Bansal
Page 27 of 81
Construct the full k-ary tree from its preorder traversal in C++
We are given an array arr[] containing the preorder traversal of the k-ary tree in sequence. The goal is to construct the same k-ary tree from it and print its postorder traversal. A full k−ary tree is the one in which the root node has 0 or k children i.e. at most k child.For ExampleInputint arr[] = {2, 5, 1, 3, 6, 7, 2, 1 }, int size = 8, int children = 2OutputThe full k−ary tree which will be constructed with the two children from preorder traversal is given below −Explanationwe are given with an array of integer values ...
Read MoreCount pairs in a binary tree whose sum is equal to a given value x in C++
We are given an integer value and a variable x and the task is to construct the binary tree and find the pairs having sum equals to the given value x.For ExampleInputint x = 5, The tree which will be created after inputting the values is given below −OutputCount of pairs in a binary tree whose sum is equal to a given value x are: 2Explanationwe are given with an array of integer values that is used to form a binary tree and we will check whether there is a pair present in a binary tree whose sum equals to ...
Read MoreConstruct Special Binary Tree from given Inorder traversal in C++
We are given an array arr[] containing the inorder traversal of a binary tree. The goal is to construct a special binary tree from that array. A special binary tree is the one which has root node’s weight greater than the weights of both its left and right children.For ExampleInputint arr[] = {10, 20, 28, 40, 32, 31, 30}OutputThe special binary tree which will be constructed with the given inorder traversal is given below −Explanationwe are given with an array of integer values or the inorder traversal of a tree. So, the special tree formed is 10, 20, 28, 40, ...
Read MoreCount the Number of Binary Search Trees present in a Binary Tree in C++
We are given a binary tree as input. The goal is to find the number of binary search trees (BSTs) present as subtrees inside it. A BST is a binary tree with left child less than root and right child more than the root.For ExampleInputThe tree which will be created after inputting the values is given below −OutputCount the Number of Binary Search Trees present in a Binary Tree are: 2Explanationwe are given with an array of integer values that is used to form a binary tree and we will check whether there is a binary search tree present in ...
Read MoreCount the pairs of vowels in the given string in C++
We are given with a string of characters and the task is to calculate the count of pairs having both the elements as vowels. As we know there are five vowels in English alphabet i.e. a, i, e, o, u and other characters are known as Consonants.Input − string str = "tutorials point”Output − Count the pairs of vowels in the given string are: 2Explanation − From the given string we can form pairs as (t, u), (u, t), (t, o), (o, r), (r, i), (i, a), (a, l), (l, s), (s, p), (p, o), (o, i), (i, n) and ...
Read MoreCount number of pairs (A <= N, B <= N) such that gcd (A , B) is B in C++
We are given an input N. The goal is to find all pairs of A, B such that 1
Read MoreCount Numbers with N digits which consists of even number of 0's in C++
We are given a number N as input. The goal is to find all N digit numbers that have an even number of 0’s as digits. The number also could have preceding zeros like in case of N=3 numbers included will be 001, 002, 003….010….so on.Let us understand with examples.Input − N=4Output − Count of no. with N digits which consists of even number of 0's are − 7047Explanation − All 4 digits numbers would be like −Smallest will be 0000, then 0011, 0012, 0013, 0014…..Highest will be 9900.Input − N=5Output − Count of no. with N digits which consists ...
Read MoreCount Numbers with N digits which consists of odd number of 0's in C++
We are given a number N as input. The goal is to find all N digit numbers that have an odd number of 0’s as digits. The number also could have preceding zeros like in case of N=3 numbers included will be 000, 011, 012….990.Let us understand with examples.Input − N=3Output − Count of no. with N digits which consists of even number of 0's are − 244Explanation − All 3 digit numbers would be like −Smallest will be 000, then 011, 012, 013, 0014…..Highest will be 990.Input − N=5Output − Count of no. with N digits which consists of ...
Read MoreCount occurrences of a string that can be constructed from another given string in C++
We are given with two strings str_1 and str_2 as input. The goal is to find the count of strings same as str_2 that can be constructed using letters picked from str_1 from which each character is used just once.Note − All alphabets in both are in the same case.Let us understand with examples.Input − str_1 = "abcaaaabca", str_2 = "bca";Output − Count occurrences of a string that can be constructed from another given string are: 2Explanation − Substrings bca in str_a −str_1[1-3]=”bca” and str[7-9]=”bca”Input − str_1 = "about", str_2 = "cout";Output − Count occurrences of a string that can ...
Read MoreCount Substrings with equal number of 0s, 1s and 2s in C++
We are given string str containing 0’s, 1’s, and 2’s only. The goal is to find all substrings of str that have equal numbers of 0’s 1’s and 2’s. If str is “12012”. Substrings with equal 0’s, 1’s, and 2’s will be “120”, “201” and “012”. The count will be 3.Let us understand with examples.Input − str=”112200120”Output −Count of Substrings with an equal number of 0s, 1s, and 2s are − 5Explanation − Substrings will bestr[0-5]=”112200”, str[1-6]=”122001”, str[5-7]=”012”, str[6-8]=”120”, str[7-0]=”201”Input − str=”12012”Output −Count of Substrings with an equal number of 0s, 1s, and 2s are: 3Explanation − Substrings will be ...
Read More