General Tree ,binary tree,traversal

What is the maximum number of children a node can have in a general tree?

• 2

• 3

• Unlimited

• It depends on the tree structure

What is the height of a general tree?

• The number of nodes in the tree.

• The number of edges on the longest path from the root to a leaf

• The number of leaf nodes

• The total number of levels in the tree

In a general tree, if a node has a degree of zero, what type of node is it?

• • Root node

• Internal node

• Leaf node

• Sibling node

In a binary tree, the node that has no parent is called:

• Leaf node

• Internal node

• Root node

• Child node

In a binary tree, the number of leaf nodes is always one more than the number of internal nodes with two children.

• True

• False

Which of the following is true about a binary tree?

• Each node has at most two children.

• Each node has exactly two children

• All nodes are either leaf nodes or internal nodes

• It is always a balanced tree

In which traversal method is the root node visited between the left and right subtrees?

• • In-order traversal

• Pre-order traversal

• Post-order traversal

• Level-order traversal

A

/ \

B C

/ \ \

D E F

What is the correct sequence of nodes visited in a post-order traversal of the tree below?

• A, B, D, E, C, F

• D, E, B, F, C, A

• D, E, B, C, F, A

• A, B, C, D, E, F

4

/ \

2 6

/ \ / \

1 3 5 7

What is the output of an in-order traversal of the following binary search tree?

• 4, 2, 1, 3, 6, 5, 7

• 1, 2, 3, 4, 5, 6, 7

• 1, 3, 2, 5, 7, 6, 4

• 7, 6, 5, 4, 3, 2, 1