menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.4k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent questions tagged binary-tree
Recent Blog Comments
Hi, could you please update us about the Mock...
Hi, just curious if there are any updates...
thanks himanshu2021. But I am asking for the page...
But IISc hasn't mentioned TCS as one of their...
@kiioo https://gateoverflow.in/blog/11426/jest-20...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Recent questions tagged binary-tree
0
votes
2
answers
1
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$
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$
asked
Nov 20, 2020
in
DS
jothee
140
views
ugcnet-oct2020-ii
data-structures
binary-tree
0
votes
1
answer
2
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
A full binary tree with $n$ non-leaf nodes contains $\log_ 2 n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
asked
Apr 2, 2020
in
DS
Lakshman Patel RJIT
146
views
nielit2016mar-scientistc
data-structures
binary-tree
0
votes
1
answer
3
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}$
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}$
asked
Apr 1, 2020
in
DS
Lakshman Patel RJIT
364
views
nielit2017oct-assistanta-it
data-structures
binary-tree
0
votes
1
answer
4
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 20
The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$
The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$
asked
Apr 1, 2020
in
DS
Lakshman Patel RJIT
196
views
nielit2017oct-assistanta-it
data-structures
binary-tree
0
votes
2
answers
5
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$
In a full binary tree number of nodes is $63$ then the height of the tree is : $2$ $4$ $3$ $6$
asked
Mar 31, 2020
in
DS
Lakshman Patel RJIT
555
views
nielit2017dec-assistanta
data-structures
binary-tree
0
votes
1
answer
6
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.
Traversing a binary tree first root and then left and right subtrees called ______ traversal. postorder. preorder. inorder. none of these.
asked
Mar 31, 2020
in
DS
Lakshman Patel RJIT
212
views
nielit2016mar-scientistb
data-structures
binary-tree
tree-traversal
2
votes
1
answer
7
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$
The number of unused pointers in a complete binary tree of depth $5$ is: $4$ $8$ $16$ $32$
asked
Mar 31, 2020
in
DS
Lakshman Patel RJIT
334
views
nielit2016dec-scientistb-it
data-structures
binary-tree
0
votes
2
answers
8
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
Which of the following need not be a binary tree? Search tree Heap AVL tree B tree
asked
Mar 31, 2020
in
DS
Lakshman Patel RJIT
234
views
nielit2016dec-scientistb-cs
data-structures
binary-tree
0
votes
2
answers
9
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$
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$
asked
Mar 31, 2020
in
DS
Lakshman Patel RJIT
252
views
nielit2016dec-scientistb-cs
data-structures
tree
binary-tree
0
votes
2
answers
10
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)$
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)$
asked
Mar 30, 2020
in
DS
Lakshman Patel RJIT
319
views
nielit2017dec-scientistb
data-structures
binary-tree
heap
0
votes
3
answers
11
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
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 tree, the tree cannot be reconstructed uniquely. Depth-first-search can be used to find the connected components of a graph. a b c d
asked
Mar 24, 2020
in
Algorithms
jothee
408
views
ugcnetjan2017ii
algorithms
binary-tree
binary-search-tree
2
votes
4
answers
12
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}$
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}$
asked
Jan 13, 2020
in
DS
Satbir
2.8k
views
isro-2020
data-structures
binary-tree
normal
1
vote
1
answer
13
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.
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.
asked
Nov 20, 2019
in
Algorithms
KUSHAGRA गुप्ता
373
views
cormen
algorithms
descriptive
binary-search-tree
binary-tree
trees
1
vote
4
answers
14
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 _________________
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 _________________
asked
May 22, 2019
in
DS
srestha
768
views
made-easy-test-series
binary-tree
1
vote
0
answers
15
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?
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?
asked
May 7, 2019
in
Algorithms
srestha
200
views
binary-tree
made-easy-test-series
2
votes
3
answers
16
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)
What is the time complexity for insertion in binary tree in worst case? O(1) O(log n) O(n) O(n log n)
asked
Apr 29, 2019
in
Programming
manikgupta123
516
views
iiith-pgee
binary-tree
time-complexity
0
votes
0
answers
17
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.
somewhere we seen that formula- How many binary tree possible without labeled =c(2n,n)/n+1. anybody explain how we get this formula.
asked
Feb 23, 2019
in
DS
sandeep singh gaur
134
views
binary-tree
30
votes
10
answers
18
GATE2019-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) _________.
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) _________.
asked
Feb 7, 2019
in
DS
Arjun
12.6k
views
gate2019
numerical-answers
data-structures
binary-tree
0
votes
2
answers
19
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
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
asked
Feb 4, 2019
in
Databases
HeartBleed
1.1k
views
databases
binary-tree
0
votes
1
answer
20
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
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
asked
Jan 28, 2019
in
DS
Ram Swaroop
352
views
data-structures
binary-tree
0
votes
0
answers
21
Binary Tree
I think its answer is 8 .Please ,can any one make it sure for me :)
I think its answer is 8 .Please ,can any one make it sure for me :)
asked
Jan 25, 2019
in
DS
Nandkishor3939
185
views
data-structures
binary-tree
0
votes
0
answers
22
Binary tree
Consider a binary tree for every node | P - Q | <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h > 0. The minimum number of nodes present in such tree of height h = 4 ( Root at 0 level)
Consider a binary tree for every node | P - Q | <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h > 0. The minimum number of nodes present in such tree of height h = 4 ( Root at 0 level)
asked
Jan 16, 2019
in
Programming
Na462
123
views
data-structures
binary-tree
algorithms
made-easy-test-series
3
votes
4
answers
23
How many Binary Search Trees are possible for a labelled nodes?
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just 1?
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just 1?
asked
Jan 16, 2019
in
DS
sripo
2.4k
views
algorithms
graph-theory
binary-search-tree
binary-search
binary-tree
trees
data-structures
2
votes
2
answers
24
#bst tree
The number of BST possible with 6 node numbered 1,2,3,4,5 and 6 with exactly one leaf node
The number of BST possible with 6 node numbered 1,2,3,4,5 and 6 with exactly one leaf node
asked
Jan 5, 2019
in
DS
amit166
160
views
binary-tree
0
votes
1
answer
25
Zeal Test Series 2019: Programming & DS - Binary Tree
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
asked
Jan 2, 2019
in
DS
Prince Sindhiya
192
views
zeal
data-structures
binary-tree
zeal2019
Page:
1
2
3
4
5
6
...
9
next »
...