Q. A binary tree is said to be a complete binary tree if all the leaf nodes of the tree are at ________.

View solution

Q. A binary tree is said to be an extended binary tree (also known as 2-tree) if all of its nodes are of _______.

View solution

Q. Like _________- binary trees can also be represented in two ways in the memory—array (sequential) representation and linked representation.

View solution

Q. In the array representation, what is represented sequentially in memory using a single one-dimensional
array?

View solution

Q. The linked representation of a binary tree is implemented by using a linked list having an_________.

View solution

Q. Traversing a binary tree refers to the process of visiting each and every node of the tree exactly how many times?

View solution

Q. In how many different ways can a tree be traversed?

View solution

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