Recent questions tagged binary-tree

4 votes

3 answers

1

GATE CSE 2021 Set 2 | Question: 16
Consider a complete binary tree with $7$ nodes. Let $A$ denote the set of first $3$ elements obtained by performing Breadth-First Search $\text{(BFS)}$ starting from the root. Let $B$ denote the set of first $3$ elements obtained by performing Depth-First Search $\text{(DFS)}$ starting from the root. The value of $\mid A-B \mid $ is _____________

Arjun asked in DS Feb 18

by Arjun

2.1k views

0 votes

2 answers

2

UGCNET-Oct2020-II: 23
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 and $L$ be the number of leaves in a complete $n$-ary tree. If $L=41$, and $I=10$, what is the value of $n$? $3$ $4$ $5$ $6$

jothee asked in DS Nov 20, 2020

by jothee

697 views

1 vote

1 answer

3

NIELIT 2016 MAR Scientist C - Section C: 31
A full binary tree with $n$ non-leaf nodes contains $\log_ 2 n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

332 views

1 vote

1 answer

4

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 2
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$ $2^{h-1} – 1$ $2^{h+1} – 1$ $2^{h+1}$

Lakshman Patel RJIT asked in DS Apr 1, 2020

by Lakshman Patel RJIT

509 views

1 vote

2 answers

5

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 20
The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$

Lakshman Patel RJIT asked in DS Apr 1, 2020

by Lakshman Patel RJIT

320 views

1 vote

2 answers

6

NIELIT 2017 DEC Scientific Assistant A - Section B: 18
In a full binary tree number of nodes is $63$ then the height of the tree is : $2$ $4$ $3$ $6$

Lakshman Patel RJIT asked in DS Mar 31, 2020

by Lakshman Patel RJIT

798 views

1 vote

0 answers

7

NIELIT 2016 MAR Scientist B - Section C: 18
Traversing a binary tree first root and then left and right subtrees called ______ traversal. postorder. preorder. inorder. none of these.

Lakshman Patel RJIT asked in DS Mar 31, 2020

by Lakshman Patel RJIT

648 views

3 votes

1 answer

8

NIELIT 2016 DEC Scientist B (IT) - Section B: 13
The number of unused pointers in a complete binary tree of depth $5$ is: $4$ $8$ $16$ $32$

Lakshman Patel RJIT asked in DS Mar 31, 2020

by Lakshman Patel RJIT

528 views

1 vote

2 answers

9

NIELIT 2016 DEC Scientist B (CS) - Section B: 15
Which of the following need not be a binary tree? Search tree Heap AVL tree B tree

Lakshman Patel RJIT asked in DS Mar 31, 2020

by Lakshman Patel RJIT

410 views

0 votes

2 answers

10

NIELIT 2016 DEC Scientist B (CS) - Section B: 42
The maximum number of nodes in a binary tree of level $k, k\geq1$ is: $2^k+1$ $2^{k-1}$ $2^k-1$ $2^{k-1}-1$

Lakshman Patel RJIT asked in DS Mar 31, 2020

by Lakshman Patel RJIT

369 views

1 vote

2 answers

11

NIELIT 2017 DEC Scientist B - Section B: 31
Consider a complete binary tree where the left and the right sub trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is: $\Omega(\log n)$ $\Omega(n\log n)$ $\Omega(n)$ $\Omega(n^2)$

Lakshman Patel RJIT asked in DS Mar 30, 2020

by Lakshman Patel RJIT

455 views

0 votes

3 answers

12

UGCNET-Jan2017-II: 25
Which of the following statements is false? Optimal binary search tree construction can be performed efficiently using dynamic programming. Breadth-first search cannot be used to find connected components of a graph. Given the prefix and postfix walks of a binary ... be reconstructed uniquely. Depth-first-search can be used to find the connected components of a graph. a b c d

jothee asked in Algorithms Mar 24, 2020

by jothee

704 views

8 votes

2 answers

13

GATE CSE 2020 | Question: 6
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially? $\Theta (n^{4})$ $\Theta (n^{2})$ $\Theta (n^{2}\log n)$ $\Theta (n^{3})$

Arjun asked in DS Feb 12, 2020

by Arjun

4.7k views

2 votes

4 answers

14

ISRO2020-23
The post-order traversal of binary tree is $ACEDBHIGF$. The pre-order traversal is $\text{A B C D E F G H I}$ $\text{F B A D C E G I H}$ $\text{F A B C D E G H I}$ $\text{A B D C E F G I H}$

Satbir asked in DS Jan 13, 2020

by Satbir

10.6k views

1 vote

1 answer

15

Cormen Edition 3 Exercise 12.1 Question 5 (Page No. 289)
Argue that since sorting $n$ elements takes $\Omega (n\ lgn)$ time in the worst case in the comparison model, any comparison-based algorithm for constructing a $BST$ from an arbitrary list of n elements takes $\Omega (n\ lgn)$ time in the worst case.

KUSHAGRA गुप्ता asked in Algorithms Nov 20, 2019

by KUSHAGRA गुप्ता

569 views

3 votes

4 answers

16

Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________

srestha asked in DS May 22, 2019

952 views

1 vote

0 answers

17

Made Easy Test Series: Binary Tree
The number of node in each left subtree is within a factor of $2.$ of the number of nodes in the corresponding right subtree. Also a node allowed to have only one child if that child has no children. This tree has worst case height $O(logn)$. $N$ is the number of nodes in the binary tree. Is this statement TRUE about Binary Tree?

srestha asked in Algorithms May 7, 2019

279 views

3 votes

3 answers

18

IIIT PGEE 2019
What is the time complexity for insertion in binary tree in worst case? O(1) O(log n) O(n) O(n log n)

manikgupta123 asked in Programming Apr 29, 2019

by manikgupta123

693 views

0 votes

0 answers

19

self doubt
somewhere we seen that formula- How many binary tree possible without labeled =c(2n,n)/n+1. anybody explain how we get this formula.

sandeep singh gaur asked in DS Feb 23, 2019

by sandeep singh gaur

186 views

37 votes

9 answers

20

GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.

Arjun asked in DS Feb 7, 2019

by Arjun

16.7k views

1 vote

2 answers

21

Gate 2019: B+ Tree
Which of the following is not correct about B + Tree, which is used for creating index of relational database table? (a) Key values in each node kept in sorted order (b) Leaf node pointer points to next node (c) B + tree is height balanced tree (d) Non-leaf node have pointers to data records

HeartBleed asked in Databases Feb 4, 2019

2.2k views

1 vote

1 answer

22

Made easy tree height
The height of a binary tree is defined as the number of nodes in the longest path from root to the leaf node. Let X be the height of a complete binary tree with 256 nodes. Then the value of X will be Answer 9

Ram Swaroop asked in DS Jan 28, 2019

559 views

1 vote

0 answers

23

Binary Tree
I think its answer is 8 .Please ,can any one make it sure for me :)

Nandkishor3939 asked in DS Jan 25, 2019

by Nandkishor3939

246 views

Page:

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

Follow @gateoverflow

GATE Overflow

Recent questions tagged binary-tree

Search GATE Overflow