In an abstract syntax tree, each internal node represents an operand and each leaf node represents an operator.
A. True
B. False
Answer: Option B
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
A. True
B. False
Answer: Option B
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion