Dark Mode

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$

mcjoshi asked in DS Aug 27, 2016

1.9k views

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

makhdoom ghaya asked in Others Aug 23, 2016

by makhdoom ghaya

4.9k views

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

dd asked in Algorithms Aug 23, 2016

by dd

2.4k views

1 vote

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}$

makhdoom ghaya asked in Algorithms Aug 21, 2016

by makhdoom ghaya

2.8k views

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

krish asked in DS Aug 21, 2016

by krish

416 views

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

go_editor asked in Combinatory Aug 20, 2016

7.1k views

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

makhdoom ghaya asked in Algorithms Aug 16, 2016

by makhdoom ghaya

2.0k views

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

smartmeet asked in DS Jul 29, 2016

491 views

1 vote

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

makhdoom ghaya asked in Algorithms Jul 21, 2016

by makhdoom ghaya

1.3k views

1 vote

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

go_editor asked in DS Jul 20, 2016

4.8k views

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 .

Don't you worry asked in DS Jul 15, 2016

by Don't you worry

2.9k views

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

parthbkgadoya asked in DS Jul 13, 2016

by parthbkgadoya

780 views

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

Sanjay Sharma asked in DS Jul 10, 2016

by Sanjay Sharma

7.5k views

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

go_editor asked in DS Jul 8, 2016

6.6k views

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

go_editor asked in DS Jul 5, 2016

4.2k views

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

ManojK asked in DS Jul 4, 2016

by ManojK

9.1k views

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

go_editor asked in DS Jul 4, 2016

1.3k views

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 ?

Kapil asked in DS Jun 23, 2016

by Kapil

881 views

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

Nachiket Karambelkar asked in DS Jun 21, 2016

by Nachiket Karambelkar

1.5k views

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

im.raj asked in DS Jun 16, 2016

by im.raj

5.4k views

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

go_editor asked in DS Jun 14, 2016

5.8k views

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

go_editor asked in DS Jun 13, 2016

3.2k views

1 vote

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$

shivani2010 asked in DS Jun 9, 2016

4.1k views

2 votes

2 answers

264

why nodes with 2 children have degree 3 in a binary tree?

sh!va asked in Unknown Category Jun 4, 2016

by sh!va

1.3k views

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$.

go_editor asked in DS May 31, 2016

1.7k views

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$.

go_editor asked in DS May 31, 2016

532 views

2 votes

1 answer

267

Minimum number of nodes in a full binary tree with height 3?

vijaycs asked in DS May 25, 2016

12.7k views

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

makhdoom ghaya asked in DS Apr 27, 2016

by makhdoom ghaya

6.2k views

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?

Akash Kanase asked in DS Apr 18, 2016

by Akash Kanase

3.0k views

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.

Akash Kanase asked in DS Apr 18, 2016

by Akash Kanase

3.5k views

Page:

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

Recent questions tagged binary-tree