In parse trees, every internal node represents a non-terminal and every leaf node represents a terminal.
A. True
B. False
Answer: Option A
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
A. True
B. False
Answer: Option A
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion