Prashnikaप्रश्निका
Code
About
‹ Back to the paper

Question 11(ii)

3 marks

Computer ScienceISC 2025 Improvement Computer Science Paper 1Case basedData structures

Answer the following questions from the binary tree.

Refer to the Binary Tree given below and answer the questions that follow: Write the post-order…

Refer to the Binary Tree given below and answer the questions that follow:
(a)[1]
Write the post-order traversal of the above tree structure.
(b)[1]
Name the internal nodes of the right subtree and the external nodes of the left subtree
(c)[1]
Write the size of the tree and the degree of node D.
Open in the Binary tree and BST tool

Answer

Answer (a)

Post-order traversal (Left, Right, Root) of the entire tree: A, C, E, D, B, H, I, G, F

Answer (b)

Right subtree (rooted at G): its nodes are G, I, H. Its internal nodes (nodes having at least one child) are G and I. Left subtree (rooted at B): its nodes are B, A, D, C, E. Its external/leaf nodes (nodes with no children) are A, C and E.

Answer (c)

Size of the tree (total number of nodes) = 9 (F, B, G, A, D, I, C, E, H). Degree of node D (number of children of D) = 2 (children C and E).