Q. The node at the top of a tree is known as the ________of the tree.

View solution

Q. Internal nodes have___________.

View solution

Q. Which concept is useful while writing programming code for implementing various operations on trees?

View solution

Q. A binary tree is a special type of tree, which can either be empty or have a finite set of nodes, such that, one of the nodes is designated as the root node and the remaining nodes are partitioned into sub trees of the root nodes known as__________.

View solution

Q. Unlike a general tree, each node in a binary tree is restricted to have at the most __________child nodes only.

View solution

Q. A binary tree is a ________data structure; each node belongs to a particular level number.

View solution

Q. The nodes belonging to the same parent node are known as_______.

View solution

Q. The depth of a binary tree is the highest level number of any ______ in the binary tree.

View solution

Q. Which line connects any two nodes?

View solution

Q. The degree of a node is equal to the number of its__________.

View solution

Q. The nodes belonging to the same parent node are known as_________.

View solution

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