Recent questions tagged binary-tree

+3 votes

6 answers

1

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) _________.

asked Feb 7 in DS by Arjun Veteran (386k points) | 4.2k views

0 votes

2 answers

2

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

asked Feb 4 in Databases by HeartBleed (485 points) | 255 views

0 votes

1 answer

3

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

asked Jan 28 in DS by Ram Swaroop Active (2.5k points) | 56 views

0 votes

0 answers

4

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

asked Jan 25 in DS by Nandkishor3939 Active (1.2k points) | 52 views

0 votes

0 answers

5

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)

asked Jan 16 in Programming by Na462 Loyal (8.7k points) | 44 views

+2 votes

1 answer

6

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?

asked Jan 16 in DS by sripo Active (1.5k points) | 109 views

0 votes

0 answers

7

#bst tree
The number of BST possible with 6 node numbered 1,2,3,4,5 and 6 with exactly one leaf node

asked Jan 5 in DS by amit166 Junior (713 points) | 44 views

0 votes

0 answers

8

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?

asked Jan 2 in DS by Prince Sindhiya Loyal (6.2k points) | 40 views

0 votes

0 answers

9

https://www.geeksforgeeks.org/data-structure-gq/binary-trees-gq/
A weight-balanced tree is a binary tree in which for each node. The number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on ... ) of such a tree on n nodes is best described by which of the following? a) b) c) d) Binary Trees

asked Dec 30, 2018 in Programming by ayush201 (27 points) | 43 views

0 votes

1 answer

10

MadeEasy Test Series: Programming & DS - Binary Tree

asked Dec 26, 2018 in DS by Shamim Ahmed Active (2.3k points) | 87 views

0 votes

1 answer

11

In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?

asked Dec 25, 2018 in DS by sripo Active (1.5k points) | 110 views

+2 votes

2 answers

12

Gateforum Test Series: Programming & DS - Binary Tree
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as B-A-C . The exact pre order traversal of the tree is? A)C-A-B B)A-B-C C)C-B-A D)Can't be determined from given information.

asked Dec 11, 2018 in DS by Parth Shah Junior (595 points) | 84 views

0 votes

1 answer

13

MadeEasy Subject Test 2019: Programming & DS - Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!

asked Dec 10, 2018 in DS by CHïntän ÞäTël (275 points) | 103 views

0 votes

0 answers

14

binary tree
Consider a binary tree, where for every node $P-Q\leq 2$.Prepresent number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for $h>0$. The minimum number of node present in such binary tree of height $h=4$ _____________ Im getting 8. kindly verify

asked Dec 4, 2018 in Programming by Pawan Kumar 2 Active (4.7k points) | 127 views

0 votes

1 answer

15

B+ Trees
can anyone share some good resources fot B+ tree deletion?

asked Nov 23, 2018 in Databases by aditi19 Active (2.4k points) | 43 views

0 votes

0 answers

16

Self doubt

asked Nov 21, 2018 in Programming by Mahbub Alam (189 points) | 33 views

0 votes

0 answers

17

Tree Traversal

asked Nov 20, 2018 in Programming by Na462 Loyal (8.7k points) | 110 views

0 votes

1 answer

18

How to understand difference between n/2 and log(n) when comes to operations on a binary tree

asked Nov 8, 2018 in DS by sripo Active (1.5k points) | 75 views

0 votes

0 answers

19

Made Easy Booklet
Suppose a binary tree has only three nodes A, B and C and you are given that the post-order traversal for the tree is B-A-C. The exact preorder traversal for the tree is. C-A-B A-B-C C-B-A A definite pre-order traversal cannot be determined from the information given

asked Nov 6, 2018 in DS by shgarg (31 points) | 82 views

0 votes

0 answers

20

Red Black Tree
What is the largest possible number of internal nodes in a red-black tree with black height $4?$

asked Oct 28, 2018 in DS by Lakshman Patel RJIT Boss (29.4k points) | 60 views

0 votes

0 answers

21

Binary tree
Assume that there is at most $1$ node at height $0$ then a binary tree with $7$ node: $1)$ Has Exactly $8$ edges $2)$ The height of this binary tree is at least $2$ and at most $6$ $3)$ The depth of the root node is zero Which of the above statement are true? $A)1$ $B)3$ $C)2 $ and $3$ $D)1 $ and $ 2$

asked Oct 27, 2018 in DS by Lakshman Patel RJIT Boss (29.4k points) | 51 views

0 votes

0 answers

22

Binary Tree
I know the answer. But is there any general FORMULA for it? If yes, please provide the complete derivation of it. In the solution, they used $\rightarrow 2^{h-1}+1.$ I tried but I am not able to derive it.

asked Oct 22, 2018 in Programming by Soumya29 Boss (15.3k points) | 53 views

0 votes

0 answers

23

Binary tree traversal
find the vertical sum of a binary tree. For example,the tree has 5 vertical lines?

asked Oct 22, 2018 in DS by Lakshman Patel RJIT Boss (29.4k points) | 72 views

0 votes

0 answers

24

Labelled Binary Tree
Consider 4 labeled 1,2,3,4. The number of distinct binary tree possible such that whose inorder traversal is 1,2,3,4 are ........

asked Oct 20, 2018 in Programming by Na462 Loyal (8.7k points) | 66 views

0 votes

2 answers

25

GATEBOOK-2019-DS2-7
In a binary tree with $n$ nodes, every non-leaf node has an even number of descendants. Every node is considered to be its own descendant. What is the number of nodes in a tree that has exactly one child? $0$ $1$ $\frac{(n - 1)}{2}$ $n-1$

asked Oct 16, 2018 in Programming by GATEBOOK Boss (15.3k points) | 234 views

+1 vote

1 answer

26

Binary tree
A. Total no. of trees that were there in the forest. B. Total no. of nodes in the forest. C. Total no. of nodes which have only right child. D. Return max element among all nodes.

asked Sep 28, 2018 in Programming by Vaishnavi01 (217 points) | 62 views

0 votes

0 answers

27

Data structures

asked Sep 28, 2018 in Programming by Vaishnavi01 (217 points) | 58 views

0 votes

2 answers

28

Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l-1 b) l-1 c) l d) 2l

asked Aug 19, 2018 in Programming by pradeepchaudhary Active (1.1k points) | 59 views

0 votes

1 answer

29

Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)

asked Aug 19, 2018 in Programming by pradeepchaudhary Active (1.1k points) | 77 views

0 votes

1 answer

30

Program of Binary Tree
Why not this code not printing 10? (It is just a binary tree with one node i.e. root. And value of root is 10) #include <stdio.h> #include<stdlib.h> struct BinaryTree *root=NULL; struct BinaryTree{ int data; struct BinaryTree *left; struct BinaryTree * ... root=node(data1); return root; } } int main() { insert(root,10); printf("%d",*root); return 0; }

asked Aug 14, 2018 in DS by srestha Veteran (108k points) | 59 views

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 questions tagged binary-tree

Recent Posts

Recent Blog Comments