Note 1
##### Take Note:

Take a note while surfing.

##### Note With Ink

Give your Note a Colorful Tag.

##### Easy to Access

Stay on same information and in Sync wherever you are.

Note 2
##### Take Note:

Organize your information,It may take Shape.

##### Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3
##### Take Note:

Don't Let information to miss,Because it take shape

##### Note With Ink

Simple an Easy Way to take a note.

##### Easy to Access

Get the same in next visit.

# Data Structures :: Trees

Home > Data Structures > Trees > General Questions

#### Co. Cloud

11. A B-tree of minimum degree t can maximum _____ pointers in a node.

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

12. A BST is traversed in the following order recursively: Right, root, left
The output sequence will be in

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

13. B Trees are generally

| | | |

Explanation:

Please explain following binary search tree case study

Suppose that a binary search tree stores, at each node, u, the height, u.height, of the subtree rooted at u, and the size, u.size of the subtree rooted at u.

1. Show how, if we perform a left rotation at u, then these two quantities can be updated, in constant time, for all nodes affected by the rotation.

2. Show how, if we perform a right rotation at u, then these two quantities can be updated, in constant time, for all nodes affected by the rotation.

3. Explain why the same result is not possible if we try to also store the depth, u.depth, of each node u.

Workspace

Tags:  No Tags on this question yet!

14. If a node having two children is deleted from a binary tree, it is replaced by its

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

15. A binary tree of depth "d" is an almost complete binary tree if

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

16. One of the major drawback of B-Tree is the difficulty of traversing the keys sequentially.

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

17. What is the maximum possible number of nodes in a binary tree at level 6?

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

18. How many nodes in a tree have no ancestors.

| | | |

Explanation:

ROOT NODE

Workspace

Tags:  No Tags on this question yet!

19. B-Trees are generally

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

20. int MFunc(tree *T)
{
int N1,N2;
if(T == NULL)
return -1;
N1 = MFunc(T->left); N2 = MFunc(T->right);
return (N1 > N2 ? N1 : N2) + 1;.
}
If T points to root of a tree, what does this function do?

| | | |

Explanation:

The given function will return the height of the tree.

Logic:
-----
1) It is done recursivly, the finction having N1, N2 which are again call
2)N1 will receive the height the left sub tree
3)N2 will receive the height of the right sub tree
4)Finally return statement is identifying the maximun value among N1 and max+1 to the previous call.
5)T will be NULL onely when the tree is empty. when come to the leaf node at leaf level the value -1 will be returned.
6)Finally the function will retrn the hieght of the tree, which is nothin the tree.

Workspace

Tags:  No Tags on this question yet!