Register

Recent questions tagged binary-tree

2 votes
1 answer
121
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.
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...
User Avatar
0 votes
0 answers
122
Data structures
User Avatar
0 votes
1 answer
123
Binary Tree Height
What is the time complexity for finding the height of the binary tree? a) h = O(loglogn) b) h = O(nlogn) c) h = O(n) d) h = O(log n)
What is the time complexity for finding the height of the binary tree?a) h = O(loglogn)b) h = O(nlogn)c) h = O(n)d) h = O(log n)
User Avatar
1 votes
2 answers
124
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
What must be the ideal size of array if the height of tree is ‘l’?a) 2l-1b) l-1c) ld) 2l
User Avatar
1 votes
1 answer
125
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)
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)
User Avatar
1 votes
3 answers
128
self-doubt
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactlyONE children are ______.
User Avatar
0 votes
0 answers
129
#avl tree
what is the worst case possible height of an avl tree ??? https://www.geeksforgeeks.org/practice-questions-height-balancedavl-tree/ how does 1.44*logn comes ????
what is the worst case possible height of an avl tree ???https://www.geeksforgeeks.org/practice-questions-height-balancedavl-tree/how does 1.44*logn comes ????
User Avatar
0 votes
0 answers
130
doubt-tree
If each node of the B-tree is 80 percent full, then what is the average number of keys per node of the above B tree?
If each node of the B-tree is 80 percent full, then what is the average number of keys per node of the above B tree?
User Avatar
2 votes
2 answers
131
self doutbt
How to Construct Full Binary Tree from given preorder and postorder? Thank you.
How to Construct Full Binary Tree from given preorder and postorder?Thank you.
User Avatar
1 votes
1 answer
132
UGC NET CSE | July 2018 | Part 2 | Question: 25
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding will have the average length of 2.4 1.87 3.0 2.15
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding will have the avera...
User Avatar
2 votes
2 answers
134
DATA STRUCTURES
What is the difference between full binary tree ,almost complete binary tree and complete binary tree? explain by drawing trees
What is the difference between full binary tree ,almost complete binary tree and complete binary tree?explain by drawing trees
User Avatar
1 votes
2 answers
135
Binary Tree
$\text{Given preorder and inorder, how many binary trees are possible?}$
$\text{Given preorder and inorder, how many binary trees are possible?}$
User Avatar
0 votes
1 answer
136
Binary Tree
How to generate post order array from given in order array [8,6,9,4,7,2,5] ?
How to generate post order array from given in order array [8,6,9,4,7,2,5] ?
User Avatar
1 votes
1 answer
139
self doubt
Give an algorithm for finding the height or depth of the tree
Give an algorithm for finding the height or depth of the tree
User Avatar
6 votes
1 answer
141
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?
What is the number of binary trees with 4 nodes which when traversed in pre-order gives the sequence 1,2,3,4?
User Avatar
1 votes
4 answers
143
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?
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 ...
User Avatar
2 votes
1 answer
149
DS BINARY TREE
NUMBER OF BINARY TREE POSSIBLE WITH 3 UNLABELED NODES?
NUMBER OF BINARY TREE POSSIBLE WITH 3 UNLABELED NODES?
User Avatar
2 votes
0 answers
150
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)
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)
User Avatar
Page: