Q. In pre-order traversal, the root node is visited before traversing its________subtrees.

View solution

Q. In which traversal, the root node is visited after the traversal of its left subtree and before the traversal of its right subtree?

View solution

Q. Elements in a nonlinear data structure do not form a sequence for example_________.

View solution

Q. One way is to have the linear relationship between the elements by means of sequential memory locations and such linear structures are called ______.

View solution

Q. What is one of the most common operations that is performed on trees?

View solution

Q. In which tree, the right NULL pointer of each node (not having a right child node) points to its in-order successor?

View solution

Q. A binary search tree, also known as_________.

View solution

Q. Which code for an alphabet (set of symbols) is generated by constructing a binary tree with nodes containing the symbols to be encoded and their probabilities of occurrence?

View solution

Q. Trees are often used in implementing _________ and hence it is considered as prime application of trees.

View solution

Q. The process of inserting a node in a binary search tree can be divided into how many steps?

View solution

Q. The number of nodes in a complete binary tree of depth d (with root at depth 0) is

View solution

Q. Every internal node in a B-tree of minimum degree 2 can have

View solution

Q. In .............. the difference between the height of the left sub tree and height of right sub tree, for each node, is not more than one.

View solution

Q. The in-order traversal of a binary tree is HFIEJGZ, and the post-order traversal of the same tree is HIFJZGE. What will be the total number of nodes in the left sub tree of the given tree? (It is NOT a search tree)

View solution

Q. If the in-order and pre-order traversal of a binary tree are D,B,F,E,G,H,A,C and A,B,D,E,F,G,H,C respectively then the post-order traversal of that tree is

View solution

Q. In a binary tree, the number of terminal or leaf nodes is 10. The number of nodes with two children is

View solution

Q. The pre-order traversal of a binary-search tree is DBACFE. What is the post-order traversal?

View solution

Q. What could be the worst case height of an AVL tree?

View solution

Q. Which amongst the following cannot be a balance factor of any node of an AVL tree?

View solution

Q. How many distinct binary search trees can be formed which contains the integers 1, 2, 3?

View solution