adplus-dvertising
frame-decoration

Question

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

a.

Zero degree

b.

Two degrees

c.

Both (a) and b)

d.

None of the above

Answer: (c).Both (a) and b)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

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

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

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

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

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

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

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

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

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

Q. A binary search tree, also known as_________.

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?

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

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

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

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

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.

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)

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