Discussion
A parse tree with n leaves for a grammar in which every production has exactly two symbols on the right has
Answer: C
Each internal node combines two subtrees into one, reducing the count by one. Starting from n leaves and ending at a single root therefore requires exactly n minus 1 combinations. The same identity underlies the node count of any full binary tree.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development