Recent questions tagged binary-tree

Given the following table of observations, calculate the information gain $IG(Y |X)$ that would result from learning the value of $X$. XYRedTrueGreenFalseBrownFalseBrownF...

Given below are two statements: one is labelled as Assertion $\mathrm{A}$ and the other is labelled as Reason $\mathrm{R}$.Assertion $\mathrm{A}$: The AVL trees are more ...

How many different trees are possible with ' $n$ ' nodes?$\mathrm{n}_{-1}$$2^{\mathrm{n}}-1$$2^{\mathrm{n}}$$2^{\mathrm{n}}-\mathrm{n}$(Option $1 [39397]) 1$(Option $2 [3...

The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2

Consider a perfect binary tree with $\mathrm{n}$ nodes and $\mathrm{h}$ height. A tree is perfect when all levels of the tree are completely full. Let root is at depth $0...

Consider the $\text{C}$ function $\text{foo}$ and the binary tree shown.typedef struct node { int val; struct node *left, *right; } node; int foo(node *p) { int retval; i...

A binary tree $\text{T}$ is full if either $\text{T}$ has one node, or the root of $\text{T}$ has two children which are roots of full binary trees. For instance, a full ...

Find the number of binary tree(s) with $3$ nodes (i.e., $\text{A, B,}$ and $\text{C})$ which when traversed by pre-order gives the sequence $\textbf{C B A}$. You also nee...

If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?