DSC UNIT 5

Every node N in a binary tree T except the root has a unique parent called the __________ of N

• Predecessor

• Antecedents

• Forerunner

• Precursor

A terminal node in a binary tree is called __________

• Root

• Child

• Leaf

• Branch

Two nodes that have the same parent are called __________

• Siblings

• Internal Nodes

• External Nodes

• Antecedents

Nodes that have children is called __________

• Siblings

• Internal Nodes

• External Nodes

• Antecedents

Nodes that don't have children called __________

• Siblings

• Internal Nodes

• External Nodes

• Antecedents

In Binary trees nodes with no successor are called __________

• End nodes

• Terminal nodes

• Final nodes

• Last nodes

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

• complete binary tree

• binary search tree

• extended binary tree

• data structure

The __________ of a binary tree is the number of nodes in it

• child

• leaf

• size

• breadth

A node with two child subtrees is a __________

• End nodes

• Terminal nodes

• leaf

• Binary Tree

Which indicates pre-order traversal?

• Left sub-tree, Right sub-tree and root

• Right sub-tree, Left sub-tree and root

• Root, Left sub-tree, Right sub-tree

• Right sub-tree, root, Left sub-tree