COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
If node N is a terminal node in a binary tree then its ____
|
|
Right tree is empty
|
|
|
Left tree is empty
|
|
|
Both left & right sub trees are empty
|
|
|
Root node is empty
|
Explanation:
Detailed explanation-1: -In a binary tree, all nodes have degree 0, 1, or 2. A node of degree zero is called a terminal node or leaf node. A non-leaf node is often called a branch node.
Detailed explanation-2: -Left-Right representation of a binary tree is standard representation where every node has a pointer to left child and another pointer to right child. Down-Right representation is an alternate representation where every node has a pointer to left (or first) child and another pointer to next sibling.
Detailed explanation-3: -Full Binary Tree Theorems The number of leaves is i + 1 . The total number of nodes is 2i + 1 . The number of internal nodes is (n – 1) / 2 . The number of leaves is (n + 1) / 2 .
There is 1 question to complete.