Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged binary-tree
3
votes
1
answer
241
Ace Test Series: Programming & DS - Binary Tree
A binary tree has 127 nodes. Which of the following is an invalid height for this tree ? $a). 16 $ $b). 6$ $c). 21$ $d). 43$
A binary tree has 127 nodes. Which of the following is an invalid height for this tree ?$a). 16 $$b). 6$$c). 21$$d). 43$
mcjoshi
1.8k
views
mcjoshi
asked
Aug 27, 2016
DS
ace-test-series
data-structures
binary-tree
+
–
4
votes
2
answers
242
UGC NET CSE | June 2011 | Part 2 | Question: 22
Given a binary tree whose inorder and preorder traversal are given by Inorder : EICFBGDJHK Preorder : BCEIFDGHJK The post order traversal of the above binary tree is I E F C G J K H D B I E F C J G K H D B I E F C G K J H D B I E F C G J K D B H
Given a binary tree whose inorder and preorder traversal are given byInorder : EICFBGDJHKPreorder : BCEIFDGHJKThe post order traversal of the above binary tree isI E F C ...
makhdoom ghaya
4.9k
views
makhdoom ghaya
asked
Aug 23, 2016
Others
ugcnetcse-june2011-paper2
algorithms
binary-tree
+
–
3
votes
3
answers
243
Binary Search Tree
Suppose we do not have a parent pointer in the nodes of a search tree, only left-child and right-child. Which of the following operations can be computed in time $O(\log n)$ for a balanced search tree? 1- find, insert, delete, but not min, max, pred, succ 2- ... pred, succ 3- find, insert, delete, pred, succ but not min, max 4- All of find, insert, delete, min, max, pred, succ
Suppose we do not have a parent pointer in the nodes of a search tree, only left-child and right-child. Which of the following operations can be computed in time $O(\log ...
dd
2.4k
views
dd
asked
Aug 23, 2016
Algorithms
binary-search
algorithms
data-structures
binary-search-tree
binary-tree
+
–
1
votes
2
answers
244
UGC NET CSE | December 2011 | Part 2 | Question: 50
The number of nodes in a complete binary tree of height $h$ (with roots at level $0$) is equal to $2^{0} + 2^{1} + ….. 2^{h}$ $2^{0} + 2^{1} + ….. 2^{h-1}$ $2^{0} + 2^{1} + ….. 2^{h+1}$ $2^{1} + ….. 2^{h+1}$
The number of nodes in a complete binary tree of height $h$ (with roots at level $0$) is equal to$2^{0} + 2^{1} + ….. 2^{h}$$2^{0} + 2^{1} + ….. 2^{h-1}$ $2^{0} + 2^{...
makhdoom ghaya
2.8k
views
makhdoom ghaya
asked
Aug 21, 2016
Algorithms
ugcnetcse-dec2011-paper2
algorithms
binary-tree
+
–
0
votes
1
answer
245
#binary tree
what is te diffrence b/w hight, depth, level in binary tree and can i say level= height+1 if yes then prove it
what is te diffrence b/w hight, depth, level in binary tree and can i say level= height+1 if yes then prove it
krish
413
views
krish
asked
Aug 21, 2016
DS
binary-tree
+
–
4
votes
1
answer
246
UGC NET CSE | June 2016 | Part 3 | Question: 31
The number of different binary trees with 6 nodes is 6 42 132 256
The number of different binary trees with 6 nodes is642132256
go_editor
7.1k
views
go_editor
asked
Aug 20, 2016
Combinatory
ugcnetcse-june2016-paper3
combinatory
binary-tree
+
–
2
votes
1
answer
247
UGC NET CSE | December 2011 | Part 2 | Question: 19
The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal. ABFCDE ADBFEC ABDECF ABDCEF
The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.ABFCDEADBFECABDECFABDCEF
makhdoom ghaya
2.0k
views
makhdoom ghaya
asked
Aug 16, 2016
Algorithms
ugcnetcse-dec2011-paper2
algorithms
binary-tree
+
–
3
votes
1
answer
248
Are descendants and children same for Binary Tree?
Please make me clear about Descendants in Binary Trees.thanks in advance
Please make me clear about Descendants in Binary Trees.thanks in advance
smartmeet
480
views
smartmeet
asked
Jul 29, 2016
DS
binary-tree
algorithms
+
–
1
votes
2
answers
249
UGC NET CSE | December 2014 | Part 2 | Question: 25
A full binary tree with $n$ leaves contains $n$ nodes $\log_{2} n$ nodes $2n –1$ nodes $2^{n}$ nodes
A full binary tree with $n$ leaves contains$n$ nodes $\log_{2} n$ nodes $2n –1$ nodes$2^{n}$ nodes
makhdoom ghaya
1.3k
views
makhdoom ghaya
asked
Jul 21, 2016
Algorithms
ugcnetcse-dec2014-paper2
algorithms
binary-tree
+
–
1
votes
1
answer
250
UGC NET CSE | September 2013 | Part 2 | Question: 21
Consider the In-order and Post-order traversals of a tree as given below: In-order: j e n k o p b f a c l g m d h i Post-order: j n o p k e f b c l m g h I d a The Pre-order traversal of the tree shall be a b f e j k n o p c d g l m h i a b c d e f j k n o p g l m h i a b e j k n o p f c d g l m h i j e n o p k f b c l m g h I d a
Consider the In-order and Post-order traversals of a tree as given below:In-order: j e n k o p b f a c l g m d h iPost-order: j n o p k e f b c l m g h I d aThe Pre-order...
go_editor
4.8k
views
go_editor
asked
Jul 20, 2016
DS
ugcnetsep2013ii
data-structures
binary-tree
+
–
4
votes
3
answers
251
Binary Tree
What is the difference between Binary Tree and Almost complete Binary tree and complete Binary Tree and full Binary Tree and Binary search Tree and Balanaced Binary Search Tree. Diagram would be appriciated otherwaise write 2-3 basic difference .
What is the difference betweenBinary Tree and Almost complete Binary tree and complete Binary Tree and full Binary Tree and Binary search Tree and Balanaced Binary Search...
Don't you worry
2.8k
views
Don't you worry
asked
Jul 15, 2016
DS
binary-tree
binary-search-tree
data-structures
+
–
0
votes
0
answers
252
GATE IT 2007 Tree Traversals
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 60? a) 35 b) 64 c) 128 d) 5040
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. ...
parthbkgadoya
771
views
parthbkgadoya
asked
Jul 13, 2016
DS
binary-tree
data-structures
+
–
5
votes
3
answers
253
UGC NET CSE | June 2016 | Part 2 | Question: 21
Consider the following binary search tree: If we remove the root node which of the node from the left subtree will be the new root? 11 12 13 16
Consider the following binary search tree:If we remove the root node which of the node from the left subtree will be the new root?11121316
Sanjay Sharma
7.5k
views
Sanjay Sharma
asked
Jul 10, 2016
DS
data-structures
binary-tree
binary-search-tree
ugcnetcse-june2016-paper2
+
–
3
votes
2
answers
254
UGC NET CSE | December 2012 | Part 2 | Question: 16
In which tree, for every node the height of its left subtree and right subtree differ almost by 1? Binary Search Tree AVL Tree Threaded Binary Tree Complete Binary Tree
In which tree, for every node the height of its left subtree and right subtree differ almost by 1?Binary Search TreeAVL TreeThreaded Binary TreeComplete Binary Tree
go_editor
6.6k
views
go_editor
asked
Jul 8, 2016
DS
ugcnetcse-dec2012-paper2
data-structures
tree
binary-tree
+
–
2
votes
1
answer
255
UGC NET CSE | June 2012 | Part 2 | Question: 27
The Inorder traversal of the tree will yield a sorted listing of elements of tree in Binary tree Binary search tree Heaps None of the above
The Inorder traversal of the tree will yield a sorted listing of elements of tree inBinary treeBinary search treeHeapsNone of the above
go_editor
4.2k
views
go_editor
asked
Jul 5, 2016
DS
data-structures
binary-tree
ugcnetcse-june2012-paper2
+
–
5
votes
3
answers
256
ISRO2016-30
A complete binary tree with $n$ non-leaf nodes contains $\log_{2}n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
A complete binary tree with $n$ non-leaf nodes contains$\log_{2}n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
ManojK
9.1k
views
ManojK
asked
Jul 4, 2016
DS
data-structures
binary-tree
isro2016
+
–
3
votes
1
answer
257
UGC NET CSE | June 2012 | Part 2 | Question: 8
A binary search tree is a binary tree in which All items in the left subtree are less than root All items in the right subtree are greater than or equal to root Each subtree is itself a binary search tree All of the above
A binary search tree is a binary tree in whichAll items in the left subtree are less than rootAll items in the right subtree are greater than or equal to rootEach subtree...
go_editor
1.3k
views
go_editor
asked
Jul 4, 2016
DS
ugcnetcse-june2012-paper2
data-structures
binary-tree
+
–
2
votes
3
answers
258
Tree traversals
If the inorder traversal and preorder traversal of a binary tree having N elements are given, then what will be the time complexity of post order traversal and level order traversal of such a tree. Plz explain also ?
If the inorder traversal and preorder traversal of a binary tree having N elements are given, then what will be the time complexity of post order traversal and level orde...
Kapil
869
views
Kapil
asked
Jun 23, 2016
DS
data-structures
binary-tree
time-complexity
+
–
2
votes
1
answer
259
gate-1990-->Total external path length of binary tree with n external nodes ?
options are - 1) <=n^2 always 2) >=nlogn always 3) n^2 4)O(n) for some special trees
options are - 1) <=n^2 always 2) >=nlogn always 3) n^2 4)O(n) for some special trees
Nachiket Karambelkar
1.5k
views
Nachiket Karambelkar
asked
Jun 21, 2016
DS
data-structures
binary-tree
+
–
2
votes
1
answer
260
UGC NET CSE | December 2012 | Part 2 | Question: 2
The worst case time complexity of AVL is tree is better in comparison to binary search tree for Search and Insert Operations Search and Delete Operations Insert and Delete Operations Search, Insert and Delete Operations
The worst case time complexity of AVL is tree is better in comparison to binary search tree forSearch and Insert OperationsSearch and Delete OperationsInsert and Delete O...
im.raj
5.4k
views
im.raj
asked
Jun 16, 2016
DS
data-structures
binary-tree
ugcnetcse-dec2012-paper2
avl-tree
+
–
7
votes
4
answers
261
ISRO2009-31
A full binary tree with $n$ leaves contains $n$ nodes $\log_2 n$ nodes $2n-1$ $2^n$ nodes
A full binary tree with $n$ leaves contains$n$ nodes$\log_2 n$ nodes$2n-1$$2^n$ nodes
go_editor
5.8k
views
go_editor
asked
Jun 14, 2016
DS
isro2009
data-structures
binary-tree
+
–
4
votes
1
answer
262
ISRO2008-75
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as binary search tree AVL tree completely balanced tree Heap
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known asbinary search treeAVL treecompletely ba...
go_editor
3.2k
views
go_editor
asked
Jun 13, 2016
DS
isro2008
data-structures
binary-tree
+
–
1
votes
1
answer
263
UGC NET CSE | September 2013 | Part 2 | Question: 11
The min. number of nodes in a binary tree of depth d (root at level 0) is $(2^d + 1)$ $(2^{(d+1)} - 1)$ $d$ $d + 1$
The min. number of nodes in a binary tree of depth d (root at level 0) is$(2^d + 1)$$(2^{(d+1)} - 1)$$d$$d + 1$
shivani2010
4.1k
views
shivani2010
asked
Jun 9, 2016
DS
binary-tree
data-structures
ugcnetsep2013ii
+
–
2
votes
2
answers
264
why nodes with 2 children have degree 3 in a binary tree?
sh!va
1.3k
views
sh!va
asked
Jun 4, 2016
Unknown Category
binary-tree
algorithms
flip-flop
+
–
14
votes
2
answers
265
ISI2014-PCB-CS-2b
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm to merge $H_1$ and $H_2$ to a new max-heap $H$ of size $2n$.
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm...
go_editor
1.6k
views
go_editor
asked
May 31, 2016
DS
descriptive
isi2014-pcb-cs
algorithms
binary-tree
binary-heap
+
–
2
votes
1
answer
266
ISI2014-PCB-CS-2a
Let $B$ be a rooted binary tree of $n$ nodes. Two nodes of $B$ are said to be a sibling pair if they are the children of the same parent. For example, given the binary tree in Figure 1, the sibling pairs are (2, 3) and (6, 7). Design an $O(n)$ time algorithm that prints all the sibling pairs of $B$.
Let $B$ be a rooted binary tree of $n$ nodes. Two nodes of $B$ are said to be a sibling pair if they are the children of the same parent. For example, given the binary tr...
go_editor
525
views
go_editor
asked
May 31, 2016
DS
descriptive
isi2014-pcb-cs
data-structures
binary-tree
+
–
2
votes
1
answer
267
Minimum number of nodes in a full binary tree with height 3?
vijaycs
12.7k
views
vijaycs
asked
May 25, 2016
DS
binary-tree
+
–
3
votes
2
answers
268
ISRO-2013-32
Which of the following number of nodes can form a full binary tree? 8 15 14 13
Which of the following number of nodes can form a full binary tree?8151413
makhdoom ghaya
6.2k
views
makhdoom ghaya
asked
Apr 27, 2016
DS
isro2013
binary-tree
easy
+
–
31
votes
2
answers
269
GATE CSE 1991 | Question: 14,c
Consider the binary tree in the figure below: Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the structures. What is the worst-case time complexity of your procedure?
Consider the binary tree in the figure below:Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the stru...
Akash Kanase
3.0k
views
Akash Kanase
asked
Apr 18, 2016
DS
gate1991
normal
data-structures
binary-tree
time-complexity
descriptive
+
–
20
votes
3
answers
270
GATE CSE 1991 | Question: 14,b
Consider the binary tree in the figure below: Give different steps for deleting the node with key $5$ so that the structure is preserved.
Consider the binary tree in the figure below:Give different steps for deleting the node with key $5$ so that the structure is preserved.
Akash Kanase
3.5k
views
Akash Kanase
asked
Apr 18, 2016
DS
gate1991
data-structures
binary-tree
normal
descriptive
+
–
Page:
« prev
1
...
4
5
6
7
8
9
10
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register