Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Search results for binary+tree
8
votes
5
answers
21
GATE CSE 2020 | Question: 5
The preorder traversal of a binary search tree is $15, 10, 12, 11, 20, 18, 16, 19$. Which one of the following is the postorder traversal of the tree? $10,11,12,15,16,18,19,20$ $11,12,10,16,19,18,20,15$ $20,19,18,16,15,12,11,10$ $19,16,18,20,11,12,10,15$
Arjun
asked
in
DS
Feb 12, 2020
by
Arjun
18.6k
views
gatecse-2020
binary-search-tree
1-mark
27
votes
6
answers
22
GATE CSE 2004 | Question: 4, ISRO2009-26
The following numbers are inserted into an empty binary search tree in the given order: $10, 1, 3, 5, 15, 12, 16$. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? $2$ $3$ $4$ $6$
Kathleen
asked
in
DS
Sep 18, 2014
by
Kathleen
22.5k
views
gatecse-2004
data-structures
binary-search-tree
easy
isro2009
90
votes
11
answers
23
GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
go_editor
asked
in
DS
Sep 26, 2014
by
go_editor
24.3k
views
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
57
votes
12
answers
24
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
go_editor
asked
in
DS
Sep 29, 2014
by
go_editor
16.2k
views
gatecse-2010
data-structures
binary-tree
normal
30
votes
5
answers
25
GATE IT 2006 | Question: 45
Suppose that we have numbers between $1$ and $100$ in a binary search tree and want to search for the number $55$. Which of the following sequences CANNOT be the sequence of nodes examined? $\{10, 75, 64, 43, 60, 57, 55\}$ $\{90, 12, 68, 34, 62, 45, 55\}$ $\{9, 85, 47, 68, 43, 57, 55\}$ $\{79, 14, 72, 56, 16, 53, 55\}$
Ishrat Jahan
asked
in
DS
Oct 31, 2014
by
Ishrat Jahan
18.4k
views
gateit-2006
data-structures
binary-search-tree
normal
48
votes
4
answers
26
GATE CSE 2000 | Question: 2.16
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited `in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the following is always true? LASTIN = LASTPOST LASTIN = LASTPRE LASTPRE = LASTPOST None of the above
Kathleen
asked
in
DS
Sep 14, 2014
by
Kathleen
17.5k
views
gatecse-2000
data-structures
binary-tree
normal
31
votes
4
answers
27
GATE CSE 2005 | Question: 35
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $42$
Kathleen
asked
in
DS
Sep 22, 2014
by
Kathleen
24.3k
views
gatecse-2005
data-structures
binary-search-tree
counting
normal
42
votes
5
answers
28
GATE IT 2008 | Question: 76
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours. $n_3$ can be expressed as $n_1 + n_2 - 1$ $n_1 -2$ $[((n_1 + n_2)/2)]$ $n_2 - 1$
Ishrat Jahan
asked
in
DS
Oct 29, 2014
by
Ishrat Jahan
16.9k
views
gateit-2008
data-structures
binary-tree
normal
33
votes
10
answers
29
GATE CSE 2017 Set 1 | Question: 6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
Arjun
asked
in
DS
Feb 14, 2017
by
Arjun
16.6k
views
gatecse-2017-set1
data-structures
binary-search-tree
easy
26
votes
4
answers
30
GATE CSE 2007 | Question: 12
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $h$ is: $2^h -1$ $2^{h-1} -1$ $2^{h+1} -1$ $2^{h+1}$
Kathleen
asked
in
DS
Sep 21, 2014
by
Kathleen
25.7k
views
gatecse-2007
data-structures
binary-tree
easy
81
votes
6
answers
31
GATE CSE 2003 | Question: 6
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements. Then $T(n) = \sum_{k=1}^{n} T(k-1)T(x)$, where $x$ is $n-k+1$ $n-k$ $n-k-1$ $n-k-2$
Kathleen
asked
in
DS
Sep 16, 2014
by
Kathleen
22.2k
views
gatecse-2003
normal
binary-search-tree
53
votes
7
answers
32
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
Ishrat Jahan
asked
in
DS
Nov 3, 2014
by
Ishrat Jahan
13.3k
views
gateit-2005
data-structures
normal
binary-search-tree
25
votes
3
answers
33
GATE CSE 2003 | Question: 19, ISRO2009-24
Suppose the numbers $7, 5, 1, 8, 3, 6, 0, 9, 4, 2$ ... $9 \ 8 \ 6 \ 4 \ 2 \ 3 \ 0 \ 1 \ 5 \ 7$
Kathleen
asked
in
DS
Sep 16, 2014
by
Kathleen
23.4k
views
gatecse-2003
binary-search-tree
easy
isro2009
64
votes
7
answers
34
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.5k
views
gateit-2005
data-structures
binary-tree
normal
2
votes
4
answers
35
ISRO2020-23
The post-order traversal of binary tree is $\text{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
18.6k
views
isro-2020
data-structures
binary-tree
tree-traversal
normal
8
votes
2
answers
36
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
gatecse-2023
data-structures
binary-tree
2-marks
65
votes
6
answers
37
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
gatecse-2016-set2
data-structures
binary-tree
normal
9
votes
3
answers
38
ISRO2011-62
The average depth of a binary search tree is $O(n^{0.5})$ $O(n)$ $O(\log n)$ $O(n \log n)$
go_editor
asked
in
DS
Jun 23, 2016
by
go_editor
21.5k
views
isro2011
data-structures
binary-search-tree
time-complexity
5
votes
3
answers
39
ISRO2016-30
A complete binary tree with $n$ non-leaf nodes contains $\log_{2}n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
ManojK
asked
in
DS
Jul 4, 2016
by
ManojK
9.1k
views
data-structures
binary-tree
isro2016
65
votes
4
answers
40
GATE CSE 2003 | Question: 63, ISRO2009-25
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
Kathleen
asked
in
DS
Sep 17, 2014
by
Kathleen
20.2k
views
gatecse-2003
data-structures
easy
isro2009
binary-search-tree
Page:
« prev
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Search results for binary+tree
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...