Dark Mode

Recent questions tagged binary-tree

2 votes

2 answers

1

Memory Based GATE DA 2024 | Question: 23
Consider a binary tree. Among the following traversal combinations, which of them can uniquely construct the tree? Inorder + Preorder Preorder + Postorder Only Inorder Inorder + Postorder

GO Classes asked in DS Feb 4

281 views

0 votes

0 answers

2

Memory Based GATE DA 2024 | Question: 55
Data Structure question: Binary tree question having four options involving no of internal nodes, leaf nodes, height etc.

GO Classes asked in DS Feb 4

191 views

7 votes

3 answers

3

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 40
You are given a complete binary tree (each level must be full except the last) on $n$ vertices. Each vertex $v$ is labeled by an integer value $x_v$. Say that a vertex is a local minimum if its label is less than the labels of each of its ... minimum in the tree? $\theta(n)$ $\theta(\sqrt{n})$ $\theta(\log n)$ $\theta(n \log n)$

GO Classes asked in DS Jan 28

735 views

2 votes

1 answer

4

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 31
How many binary trees with $3$ nodes, $\text{A, B},$ and $\text{C}$ when traversed in post-order will give the sequence $\text{A, B, C}?$ (It is NOT a search tree)

GO Classes asked in DS Jan 21

415 views

4 votes

2 answers

5

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 32
The in-order traversal of a binary tree is $\textsf{HFIEJGZ},$ and the post-order traversal of the same tree is $\textsf{HIFJZGE}.$ What will be the total number of nodes in the left sub-tree of the given tree? (It is NOT a search tree)

GO Classes asked in DS Jan 21

352 views

0 votes

1 answer

6

UPENN | ML | DECISION TREE
Given the following table of observations, calculate the information gain $IG(Y |X)$ that would result from learning the value of $X$. X Y Red True Green False Brown False Brown False (a) 1/2 (b) 1 (c) 3/2 (d) 2 (e) none of the above

rajveer43 asked in Artificial Intelligence Jan 16

215 views

0 votes

0 answers

7

Operating system binary semaphores
Find initial values of binary semaphores X and Y. P and V operation for counting semaphore b is defined as: P(b): b--; wait if b<0; V(b): b++; wakeup any waiting process in b if b<=0; Pa (wait) and Va (signal) are implemented as: P(b): Pa(Y); b--; if(b<0) { Va(Y); Pa(X); } else Va(Y); V(b): Pa(Y); b++; if(b<=0) { Va(Y); Va(X); }

jasper asked in Others Oct 21, 2023

by jasper

353 views

0 votes

0 answers

8

Ace test series
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ? 255 and 6560 127 and 2186 6561 and 255 255 and 2186

none30 asked in DS Jun 11, 2023

by none30

434 views

0 votes

0 answers

9

testbook question
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

jugnu1337 asked in DS May 16, 2023

364 views

0 votes

1 answer

10

data structure tree
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

jugnu1337 asked in Programming in C May 16, 2023

795 views

3 votes

0 answers

11

GO Classes 2023 | IIITH Mock Test 1 | Question: 14
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$ and leaves are at height $0.$ Assume Expected height of any ... $S1$ is correct but $S2$ is incorrect $S1$ is incorrect but $S2$ is correct Both are correct Both are incorrect

GO Classes asked in DS Mar 26, 2023

594 views

8 votes

2 answers

12

GATE CSE 2023 | Question: 37
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; if (p == NULL) return 0; else { retval = p->val + foo(p->left) + foo(p->right); printf("%d ", ... $3 \;5\; 8\; 10\; 11\; 13$ $3 \;8 \;16 \;13\; 24\; 50$ $3\; 16\; 8\; 50\; 24\; 13$

admin asked in DS Feb 15, 2023

by admin

6.6k views

0 votes

0 answers

13

#selfdoubt
Let n players enter a chess tournament. How many tournament trees are possible? RULES: a player is eliminated after one loss and games are played until only one entrant is left(assume no ties) My approach: (please check if it is correct) there are 3 possible binary tree skeletons w.r.t ... )C2 * (n-4)C2 *...*1} * 2^(n-1) similarly we can do the remaining cases. Is the above method right?

robinofautumn asked in Combinatory Jan 11, 2023

by robinofautumn

317 views

0 votes

0 answers

14

damz1499 asked in DS Dec 29, 2022

385 views

1 vote

1 answer

15

DRDO CSE 2022 Paper 1 | Question: 27
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 need to draw each such tree.

admin asked in DS Dec 15, 2022

by admin

383 views

1 vote

1 answer

16

DRDO CSE 2022 Paper 1 | Question: 28
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?

admin asked in DS Dec 15, 2022

by admin

243 views

Page:

1
2
3
4
5
6
...
11
next »

Recent questions tagged binary-tree