## Product of all nodes in a Binary Tree

Given a Binary Tree. The task is to write a program to find the product of all of the nodes of the given binary tree.… Read More »

## Find the maximum node at a given level in a binary tree

Given a Binary Tree and a Level. The task is to find the node with the maximum value at that given level. Recommended: Please try… Read More »

## Subtree of all nodes in a tree using DFS

Given n nodes of a tree and their connections, print Subtree nodes of every node. Subtree of a node is defined as a tree which… Read More »

## Disjoint Set Union on trees | Set 2

Given a tree, and the cost of a subtree is defined as |S|*AND(S) where |S| is the size of the subtree and AND(S) is bitwise… Read More »

## Disjoint Set Union on trees | Set 1

Given a tree and weights of nodes. Weights are non-negative integers. Task is to find maximum size of a subtree of a given tree such… Read More »

## Find largest subtree sum in a tree

Given a binary tree, task is to find subtree with maximum sum in tree. Examples: Input : 1 / \ 2 3 / \ /… Read More »

## Data Structures | Binary Trees | Question 15

Consider a node X in a Binary Tree. Given that X has two children, let Y be Inorder successor of X. Which of the following… Read More »

## Data Structures | Binary Trees | Question 14

Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right sub stress, respectively, of node… Read More »

## Data Structures | Binary Trees | Question 13

Postorder traversal of a given binary search tree, T produces the following sequence of keys 10, 9, 23, 22, 27, 25, 15, 50, 95, 60,… Read More »

## Data Structures | Binary Trees | Question 12

A scheme for storing binary trees in an array X is as follows. Indexing of X starts at 1 instead of 0. the root is… Read More »

## Data Structures | Binary Trees | Question 11

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a… Read More »

## Data Structures | Binary Trees | Question 10

A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes… Read More »

## Data Structures | Binary Trees | Question 9

A weight-balanced tree is a binary tree in which for each node. The number of nodes in the left sub tree is at least half… Read More »

## Data Structures | Binary Trees | Question 8

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is: (A) n/2 (B) (n-1)/3… Read More »

## Data Structures | Binary Trees | Question 6

The maximum number of binary trees that can be formed with three unlabeled nodes is: (A) 1 (B) 5 (C) 4 (D) 3 Answer: (B)… Read More »