adplus-dvertising
frame-decoration

Question

…………………. Is a directed tree in which out degree of each node is less than or equal to two.

a.

Unary tree

b.

Binary tree

c.

Trinary tree

d.

Both B and C

Answer: (b).Binary tree

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. …………………. Is a directed tree in which out degree of each node is less than or equal to two.

Similar Questions

Discover Related MCQs

Q. State true or false.

i) An empty tree is also a binary tree.

ii) In strictly binary tree, the out-degree of every node is either o or 2.

Q. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

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

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