Register

Recent questions tagged binary-tree

0 votes
0 answers
91
self doubt
somewhere we seen that formula- How many binary tree possible without labeled =c(2n,n)/n+1. anybody explain how we get this formula.
somewhere we seen that formula-How many binary tree possible without labeled =c(2n,n)/n+1. anybody explain how we get this formula.
User Avatar
1 votes
1 answer
94
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
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...
User Avatar
1 votes
0 answers
95
Binary Tree
I think its answer is 8 .Please ,can any one make it sure for me :)
I think its answer is 8 .Please ,can any one make it sure for me :)
User Avatar
0 votes
0 answers
97
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)
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. T...
User Avatar
0 votes
1 answer
98
ME TEST SERIES
User Avatar
3 votes
2 answers
99
#bst tree
The number of BST possible with 6 node numbered 1,2,3,4,5 and 6 with exactly one leaf node
The number of BST possible with 6 node numbered 1,2,3,4,5 and 6 with exactly one leaf node
User Avatar
0 votes
1 answer
100
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?
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?
User Avatar
0 votes
2 answers
104
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ? Does it vary for binary tree? What do you mean by internal nodes? Non root node and leaf node?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?Does it vary for binary tree?What do you mean by internal nodes? Non roo...
User Avatar
4 votes
2 answers
105
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.
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-BB)A-...
User Avatar
1 votes
2 answers
106
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!
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!
User Avatar
0 votes
0 answers
108
SELF DOUBT BINARY SEARCH
https://gateoverflow.in/132037/self-doubt-in-binary-search-algo DOUBT : THIS QUESTION 10 ELEMENTS ARE IN ARRAY AND SORTED THEN HOW CAN WE DRAW A BALANCED TREE BECZ IT IS ALWAYS GIVING SKEWED TREE.
https://gateoverflow.in/132037/self-doubt-in-binary-search-algoDOUBT : THIS QUESTION 10 ELEMENTS ARE IN ARRAY AND SORTED THEN HOW CAN WE DRAW A BALANCED TREE BECZ IT I...
User Avatar
0 votes
1 answer
109
B+ Trees
can anyone share some good resources fot B+ tree deletion?
can anyone share some good resources fot B+ tree deletion?
User Avatar
0 votes
0 answers
110
Self doubt
User Avatar
2 votes
3 answers
111
Tree Traversal
User Avatar
2 votes
1 answer
112
MADEEASY
User Avatar
0 votes
1 answer
114
How to understand difference between n/2 and log(n) when comes to operations on a binary tree
For a heap containing n elements,smallest element can be found in n/2 operations.I always get confused and think as logn operations.Please help me differentiating between these two times.
For a heap containing n elements,smallest element can be found in n/2 operations.I always get confused and think as logn operations.Please help me differentiating between...
User Avatar
0 votes
0 answers
115
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
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....
User Avatar
0 votes
1 answer
116
Red Black Tree
What is the largest possible number of internal nodes in a red-black tree with black height $4?$
What is the largest possible number of internal nodes in a red-black tree with black height $4?$
User Avatar
0 votes
0 answers
118
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.
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 tri...
User Avatar
0 votes
0 answers
119
Binary tree traversal
find the vertical sum of a binary tree. For example,the tree has 5 vertical lines?
find the vertical sum of a binary tree. For example,the tree has 5 vertical lines?
User Avatar
0 votes
0 answers
120
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 ........
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 ........
User Avatar
Page: