Q. Number of possible binary trees with 3 nodes is

View solution

Q. A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be

View solution

Q. A binary tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24 The number of nodes in the left of the root respectively is

View solution

Q. Consider the following nested representation of binary trees indicates y and z are the left right subtrees, respectively, of node x. Note that y and z may be NULL or further nested. Which of the following represents a valid binary tree?

View solution

Q. B+- trees are preferred to binary trees in databases because

View solution

Q. A full binary tree with n non-leaf nodes contains

View solution

Q. The depth of a complete binary tree with 'n nodes is (log is to be base two)

View solution

Q. Which of the below diagram is following AVL tree property?

View solution

Q. Is the below tree representation of 50,100,400,300,280 correct way to represent cartesian tree?

View solution

Q. What is the condition for a tree to be weight balanced. where a is factor and n is a node?

View solution

Q. What are the operations that can be performed on weight balanced tree?

View solution

Q. Consider a weight balanced tree such that, 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 the path from the root to the farthest leaf) of such a tree on k nodes can be described as

View solution

Q. What does the below definations convey?

i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.
ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.

View solution

Q. Elements in a tree can be indexed by its position under the ordering of the keys and the ordinal position of an element can be determined, both with good efficiency.

View solution

Q. What is the special property of red-black trees and what root should always be?

View solution

Q. Why do we impose restrictions like
. root property is black
. every leaf is black
. children of red node are black
. all leaves have same black

View solution

Q. Cosider the below formations of red-black tree. All the below formations are incorrect for it to be a redblack tree. Then what may be the correct order?

View solution

Q. What are the operations that could be performed in O(logn) time complexity by red-black tree?

View solution

Q. Which of the following is an application of Red-black trees and why?

View solution

Q. When it would be optimal to prefer Red-black trees over AVL trees?

View solution