Recent questions tagged binary-tree

+1 vote

0 answers

1

Counting No of Trees - College Exam
Want help with part (a). Other parts can be done accordingly. According to the solution, I understand how to find the limits of the sum, but why is there a factor of 2 with T(k) * T(n-k-1), according to my understanding it should not be there ... ) is the count of right sub-trees, so there are only T(k)*T(n-k-1) possibilities for each k, sum over the limits

asked Mar 25 in Algorithms by Yash Khanna (235 points) | 39 views

+4 votes

1 answer

2

Binary Tree
What is the number of binary trees with 4 nodes which when traversed in pre-order gives the sequence 1,2,3,4?

asked Mar 22 in DS by srestha Veteran (81.9k points) | 130 views

+1 vote

0 answers

3

GATE1997_16
In this GATE ques- Part a) For Size balanced tree the recurrence (max height) is T(h)=T(h-1) +T(h-2) +1, solving which we get T(0)=1, T(1)=2,T(2)=1+2+1=4, T(3)=4+2+1=7 Here, T(0),T(1),T(2) are of the form 2h but T(3) is not equal to 23 then how can we claim that "size-balance binary tree of height 'h' contain at least 2h nodes." ?

asked Mar 14 in DS by Mamta Satywali Active (2.2k points) | 99 views

0 votes

4 answers

4

trees
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not obtain a tree at all?

asked Feb 19 in DS by Parimal Paritosh (169 points) | 103 views

+1 vote

1 answer

5

Binary Tree
I have doubt when its asked to know number of labelled and unlabelled binary tree : For labelled = (On basis of labelling) T(n) = 2nCn/(n+1) * n! For unlabelled = (On Basis of Geometric Sturucture) T(n) = (2n)Cn/n+1 Right? What if its Asked for BST what will be the answer in both the above cases and Why?

asked Feb 17 in Algorithms by Na462 Active (1.6k points) | 72 views

+5 votes

4 answers

6

GATE2018-20
The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The inorder traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is _____

asked Feb 14 in DS by gatecse Boss (17.9k points) | 1.2k views

+6 votes

1 answer

7

Binary Search Tree
Q1. How many binary search trees possible with $11$ distinct key? Q2. How many binary search trees possible with $11$ un-labelled nodes? Q3. How many binary search trees possible with $11$ labelled nodes? Q4. How many binary trees possible with $11$ ... Q5. How many binary trees possible with $11$ un-labelled nodes? Q6. How many binary trees possible with $11$ labelled nodes?

asked Feb 2 in DS by Lakshman Patel RJIT Loyal (7.5k points) | 211 views

+2 votes

0 answers

8

MultiSubject (CO, DIgital, DS)
A 4-bit modulo-16 ripple counter uses JK flip-flops. If the propagation delay of each FF is 100 ns, the maximum clock frequency that can be used is equal to: Ans 2.5MHz. I think it should be $\frac{1}{16*10^{-7}} = 0.625MHz$ ... minimum number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is Ans = 840 I am getting 860.

asked Jan 25 in Programming by Shubhanshu Boss (14.9k points) | 59 views

+2 votes

0 answers

9

Tree level/ Tree height
int find(Struct Node *root){ int a = 0, b = 0, c = 0; if(root == NULL) return 0; if(root-->left == NULL && root--->right == NULL) return 1; else a = find(root--->left); b = find(root--->right); c = 1 + max(a,b); return c; } What does the above code find? a) #levels b) height of a rooted tree

asked Jan 18 in Programming by Tuhin Dutta Loyal (7.6k points) | 64 views

+1 vote

0 answers

10

DS BINARY TREE
NUMBER OF BINARY TREE POSSIBLE WITH 3 UNLABELED NODES?

asked Jan 7 in DS by iarnav Loyal (6.6k points) | 73 views

+2 votes

0 answers

11

DS BINARY TREE
WHAT IS THE RECURRENCE RELATION TO the number of different binary trees on n distinct NODES? I THINK IT IS- T(n)=∑nk=1T(k−1)T(n-k)

asked Jan 7 in DS by iarnav Loyal (6.6k points) | 49 views

+1 vote

0 answers

12

DS TREES
Consider a binary tree T that has 150 leaf nodes. Then the number of TOTAL nodes in T that have exactly two children are ______.

asked Jan 7 in DS by iarnav Loyal (6.6k points) | 90 views

–2 votes

0 answers

13

DS BINARY TREE
Consider a binary tree T that has 100 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.

asked Jan 7 in DS by iarnav Loyal (6.6k points) | 55 views

0 votes

1 answer

14

DS BINARY TREE
Consider a binary tree T that has 100 leaf nodes. Then the number of INTERNAL nodes in T that have exactly two children are ______.

asked Jan 7 in DS by iarnav Loyal (6.6k points) | 109 views

–1 vote

1 answer

15

DS COMPLETE BINARY TREE
IS IT A CBT?

asked Jan 7 in DS by iarnav Loyal (6.6k points) | 57 views

+1 vote

1 answer

16

binary treee
The minimum size that an array may require to store a binary tree with 'n' nodes is ______. if queston is about min size of an array ..then we go with compete binary tree or not.

asked Jan 3 in Programming by Jaspreet Kaur Bains Junior (753 points) | 49 views

+1 vote

0 answers

17

If the average depth of a node in an n-node binary search tree is O(lg n), then the height of the tree is

asked Dec 25, 2017 in DS by Rohit Gupta 8 Active (2.1k points) | 114 views

+2 votes

2 answers

18

ISRO-DEC2017-57
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary tree is $\text{e d b g f c a}$ $\text{e d b f g c a }$ $\text{d e b f g c a}$ $\text{d e f g b c a}$

asked Dec 17, 2017 in DS by gatecse Boss (17.9k points) | 372 views

+1 vote

0 answers

19

Balanced Binary Tree vs Complete Tree
Balanced Binary Tree vs Complete Tree Insertion and Deletion is faster in which of the above 2 structures?

asked Dec 8, 2017 in Algorithms by VS Loyal (7.5k points) | 77 views

+2 votes

1 answer

20

How to draw a Binary tree

asked Dec 5, 2017 in DS by LoveCS (31 points) | 99 views

+3 votes

3 answers

21

Number of binary search trees
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264

asked Nov 27, 2017 in DS by Parshu gate Active (4.8k points) | 314 views

+1 vote

1 answer

22

Tree Traversal doubt
Please tell me - 1) What is top down evaluation of Parse tree? 2) What is Bottom Up evaluation of Parse Tree 3) What is Depth First left to right evaluation of Parse tree? Is 1 and 3 are equal? Please make a small tree and show how to traverse Top down and Bottom up? Also, Explain how Top down and Bottom up Parser work is it same as Tree evaluation?

asked Nov 22, 2017 in Compiler Design by iarnav Loyal (6.6k points) | 56 views

+2 votes

3 answers

23

tree traversals , how to approach?
Let T be a rooted binary tree whose vertices are labelled with symbols a, b, c, d, e, f, g, h, i, j, k. Suppose the in-order and post-order traversals of T produce the following sequences. in-order: a, b, c, d, e, f, g, h, i, j, k post-order: a, c, b, e, f, h, j, k, i, g, d How many leaves does the tree have?

asked Nov 13, 2017 in DS by Parshu gate Active (4.8k points) | 80 views

+2 votes

3 answers

24

Tree traversals
For a binary tree T, preorder traversal yields: 11,8,6,4,7,10,19,43,31,29,37,49 and inorder traversal yields: 4,6,7,8,10,11,19,29,31,37,43,49 The height of the T is ________________.

asked Nov 13, 2017 in DS by Parshu gate Active (4.8k points) | 110 views

+1 vote

1 answer

25

Does unique binary tree is possible with full binary tree and preorder and postorder ?

asked Nov 10, 2017 in Programming by sunil sarode Active (1.1k points) | 62 views

0 votes

1 answer

26

ugc net November 2017
Consider a full binary tree with n internal nodes, internal path length i and external path length e. The internal path length of a full binary tree is the sum taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum , ... of each leaf. Which f the following is correct for the full binary tree? e=i+n e=i+2n e=2i+n e=2n+i

asked Nov 8, 2017 in DS by iarnav Loyal (6.6k points) | 281 views

0 votes

1 answer

27

Binary Tree construction
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong) Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.

asked Nov 8, 2017 in DS by humblefool Junior (927 points) | 181 views

+1 vote

0 answers

28

BINARY TREE
A rooted tree with 8 nodes has its nodes [1.....8] in preorder.When the tree is traversed in postorder.....nodes visited are {3,5,4,2,7,8,6,1}. Draw a tree for it. How to solve .....someone please explain?

asked Nov 1, 2017 in DS by Shivi rao Junior (775 points) | 105 views

+3 votes

1 answer

29

Trees
Number of rooted labeled trees(i.e. each node can be the root) with 6 vertices is:

asked Nov 1, 2017 in Programming by Shivam Chauhan Loyal (8.7k points) | 104 views

+2 votes

0 answers

30

Binary Tree
Consider the following routine on binary tree void do(struct btnode *t) { if(t) { Do(t->Rightchild); Do(t->Leftchild); swap(t->Rightchild,t->Leftchild); } } 1) What does Do(t) do on following binary tree after running the code? a) b)

asked Oct 29, 2017 in DS by srestha Veteran (81.9k points) | 78 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