adplus-dvertising
frame-decoration

Question

A binary tree whose every node has either zero or two children is called

a.

Complete binary tree

b.

Binary search tree

c.

Extended binary tree

d.

None of above

Answer: (c).Extended binary tree

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 whose every node has either zero or two children is called

Similar Questions

Discover Related MCQs

Q. The depth of a complete binary tree is given by

Q. When representing any algebraic expression E which uses only binary operations in a 2-tree,

Q. A binary tree can easily be converted into a 2-tree

Q. When converting binary tree into extended binary tree, all the original nodes in binary tree are

Q. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

Q. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called

Q. The in order traversal of tree will yield a sorted listing of elements of tree in

Q. In a Heap tree

Q. Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:

Note: The height of a tree with a single node is 0.

Q. Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.

Q. B Trees are generally

Q. If a node having two children is deleted from a binary tree, it is replaced by its

Q. A full binary tree with 2n+1 nodes contain

Q. If a node in a BST has two children, then its inorder predecessor has

Q. A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as

Q. A full binary tree with n leaves contains

Q. The number of different directed trees with 3 nodes are

Q. One can convert a binary tree into its mirror image by traversing it in

Q. A B-tree of minimum degree t can maximum _____ pointers in a node.

Q. A BST is traversed in the following order recursively: Right, root, left. The output sequence will be in