Dark Mode

Recent questions tagged binary-tree

65 votes

6 answers

271

GATE CSE 2016 Set 2 | Question: 36
Consider the following New-order strategy for traversing a binary tree: Visit the root; Visit the right subtree using New-order; Visit the left subtree using New-order; The New-order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 - 2 ^ 6 7 * 1 + - is given ... $1 \ 7 \ 6 * + \ 2 \ 5 \ 4 \ 3 \ * \ - \wedge -$

Akash Kanase asked in DS Feb 12, 2016

by Akash Kanase

16.6k views

5 votes

2 answers

272

Labeled binary tree
Number of labeled binary trees are there on vertices {1,2,3,4} that have only vertex 1 as leaf and every binary trees has 4 nodes are _______.

prathams asked in Quantitative Aptitude Jan 27, 2016

3.5k views

5 votes

5 answers

273

Number of nodes in heap of height 'h'
The number of nodes of height $h$ in any $n$-element heap is ________. $h$ $2^{h}$ ceil $\left[\frac{n}{2^{h}}\right]$ ceil $\left[\frac{n}{2^{h+1}}\right]$ Answer is given as D, But I think it should be C. Because, even if you take height=1 then possible nodes are 3 and 2.

Tushar Shinde asked in DS Jan 19, 2016

by Tushar Shinde

14.0k views

10 votes

5 answers

274

MadeEasy Test Series: Programming & DS - Binary Tree
The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?

Tushar Shinde asked in DS Jan 18, 2016

by Tushar Shinde

4.1k views

4 votes

1 answer

275

What's the difference between Binary tree height, level and depth?
What's the difference between Binary tree height, level and depth? Sometimes it's confusing! Does there definition change according to question also, if mentioned?

Shashank Chavan asked in DS Jan 18, 2016

by Shashank Chavan

11.1k views

1 vote

7 answers

276

The maximum number of nodes on level i of a binary tree
Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is In the following answers, the operator '^' indicates power a) 2^i-1 b)2^i c)2^i+1 d)2^(i+1/2)

Akanksha Kesarwani asked in DS Jan 16, 2016

by Akanksha Kesarwani

101k views

0 votes

1 answer

277

depth of the binary tree with n node?

monali asked in DS Jan 11, 2016

by monali

783 views

0 votes

0 answers

278

How to form a recurrence for finding the height of a weight balanced binary tree?
A weight balanced tree is a binary tree in which for each node, the no. of nodes in the left subtree is atleast half and at most twice the no. of nodes in the right sub tree. So how to approach for forming a recurrence for finding the height of this weight balanced binary tree ?

radha gogia asked in DS Jan 10, 2016

433 views

2 votes

1 answer

279

Number of different possible orders for traversing to a particular node in a Binary Search Tree
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing ... these keys values can occur on the search path from the root to node containing the value 50 are ________.

Utk asked in DS Jan 4, 2016

by Utk

690 views

0 votes

1 answer

280

MadeEasy Test Series 2018: Programming & DS - Binary Tree
Consider the below code which run on any tree. In-order traversal Post-order traversal Pre-order traversal None of these

Sandeep Singh asked in DS Dec 27, 2015

by Sandeep Singh

481 views

0 votes

2 answers

281

What will be the recurrence relation of the given below program for Preorder traversing technique?
Preorder(root) { Printf("root.data"); Preorder(root.leftsidetree); Preorder(root.rightside); }

piyushkr asked in DS Dec 24, 2015

948 views

0 votes

2 answers

282

how many threads are there.

venky.victory35 asked in DS Dec 20, 2015

by venky.victory35

679 views

43 votes

4 answers

283

TIFR CSE 2015 | Part B | Question: 4
First, consider the tree on the left. On the right, the nine nodes of the tree have been assigned numbers from the set $\left\{1, 2,\ldots,9\right\}$ so that for every node, the numbers in its left subtree and right subtree lie in disjoint intervals (that is, all numbers in one subtree ... $2^{4}.3^{2}.5.9=6480$ $2^{3}.3.5.9=1080$ $2^{4}=16$ $2^{3}.3^{3}=216$

makhdoom ghaya asked in DS Dec 7, 2015

by makhdoom ghaya

4.2k views

10 votes

2 answers

284

TIFR CSE 2014 | Part B | Question: 1
Let $T$ be a rooted binary tree whose vertices are labelled with symbols $a, b, c, d, e, f, g, h, i, j, k$. Suppose the in-order (visit left subtree, visit root, visit right subtree) and post-order (visit left subtree, visit right ... How many leaves does the tree have? THREE. FOUR. FIVE. SIX. Cannot be determined uniquely from the given information.

makhdoom ghaya asked in DS Nov 19, 2015

by makhdoom ghaya

2.2k views

39 votes

2 answers

285

TIFR CSE 2013 | Part B | Question: 13
Given a binary tree of the following form and having $n$ nodes, the height of the tree is $\Theta \left(\log n\right)$ $\Theta \left(n\right)$ $\Theta \left(\sqrt{n}\right)$ $\Theta \left(n / \log n\right)$ None of the above.

makhdoom ghaya asked in DS Nov 7, 2015

by makhdoom ghaya

3.5k views

10 votes

1 answer

286

TIFR CSE 2012 | Part B | Question: 16
Consider a complete binary tree of height $n$, where each edge is one Ohm resistor. Suppose all the leaves of the tree are tied together. Approximately how much is the effective resistance from the root to this bunch of leaves for very large $n$? Exponential in $n$. Cubic in $n$. Linear in $n$. Logarithmic in $n$. Of the order square root of $n$.

makhdoom ghaya asked in DS Nov 2, 2015

by makhdoom ghaya

1.9k views

0 votes

5 answers

287

What is the level number of an element present in an array of n integers interpreted as a complete binary tree?

radha gogia asked in DS Sep 30, 2015

1.7k views

2 votes

2 answers

288

Inorder traversal of BST if it contain two identical elements.
if two identical elements are present in BST then how inorder can give sorted array as output ? for ex. if 50,30,45,35,56,58,74,50,15 are inserted to make BST.

Neerajnandal asked in DS Jul 21, 2015

by Neerajnandal

778 views

8 votes

2 answers

289

number of comparision in searching in BST
Consider the following Binary Search Tree 10 / \ 5 20 / / \ 4 15 30 / 11 If we randomly search one of the keys present in above BST, what would be the expected number of comparisons? (A) 2.75 (B) 2.25 (C) 2.57 (D) 3.25

anurag_am asked in DS Jun 17, 2015

18.4k views

0 votes

1 answer

290

Time com
Consider a binary tree having 'n' elements or 'n' nodes the tree is organized in such a way that at every level 'i' there are 'i' nodes assuming root to be at level 1 the height or depth of binary tree is O(......)

supraja asked in DS Apr 18, 2015

553 views

42 votes

12 answers

291

GATE CSE 2015 Set 3 | Question: 25
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.

go_editor asked in DS Feb 14, 2015

24.0k views

23 votes

4 answers

292

GATE CSE 2015 Set 1 | Question: 25
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height $5$ are $63$ and $6$, respectively $64$ and $5$, respectively $32$ and $6$, respectively $31$ and $5$, respectively

makhdoom ghaya asked in DS Feb 13, 2015

by makhdoom ghaya

10.9k views

35 votes

12 answers

293

GATE CSE 2015 Set 2 | Question: 10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.

go_editor asked in DS Feb 12, 2015

30.2k views

0 votes

2 answers

294

Is it option A ?

Palash Nandi 1 asked in DS Nov 16, 2014

by Palash Nandi 1

698 views

64 votes

7 answers

295

GATE IT 2005 | Question: 50
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h-1}$ $2^{h-1} + 1$ $2^h - 1$ $2^h$

Ishrat Jahan asked in DS Nov 3, 2014

by Ishrat Jahan

22.6k views

23 votes

4 answers

296

GATE IT 2004 | Question: 54
Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?

Ishrat Jahan asked in DS Nov 2, 2014

by Ishrat Jahan

4.9k views

44 votes

3 answers

297

GATE IT 2006 | Question: 73
An array $X$ of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If the root node is at level $0$, the level of element $X[i]$, $i \neq 0$, is $\left \lfloor \log _2 i \right \rfloor$ ... $\left \lfloor \log _2 (i+1) \right \rfloor$ $\left \lceil \log _2 i \right \rceil$

Ishrat Jahan asked in DS Nov 1, 2014

by Ishrat Jahan

9.0k views

44 votes

5 answers

298

GATE IT 2006 | Question: 71
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[i], i \neq 0$, is? $\left \lfloor \dfrac i 2 \right \rfloor$ $\left \lceil \dfrac{i-1}{2} \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil - 1$

Ishrat Jahan asked in DS Nov 1, 2014

by Ishrat Jahan

13.6k views

57 votes

11 answers

299

GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$

Ishrat Jahan asked in DS Oct 31, 2014

by Ishrat Jahan

26.0k views

61 votes

8 answers

300

GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$

Ishrat Jahan asked in Computer Networks Oct 30, 2014

by Ishrat Jahan

18.9k views

Page:

« prev
1
...
5
6
7
8
9
10
11
next »

Recent questions tagged binary-tree