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

Q. Level of any node of a tree is

View solution

Q. In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.

View solution

Q. The order of a B-Tree with 2, 3, 4 or 5 children in every internal node is

View solution

Q. The number of nodes that have no successors in a complete binary tree of depth 4 is

View solution

Q. One can make an exact replica of a Binary Search Tree by traversing it in ...............

View solution

Q. A complete Binary Tree with 15 nodes contains ................. edges.

View solution

Q. Visiting root node after visiting left and right sub-trees is called .............

View solution

Q. A complete binary tree with the property that the value of each node is at least as large as the values of its children is known as ..............

View solution