ERIC Number: EJ263584
Record Type: Journal
Publication Date: 1982
Reference Count: N/A
Counting Strictly Binary Rooted Trees: Specialized Data Structures.
King, Ronald S.
Mathematics and Computer Education, v16 n2 p116-21 Spr 1982
A program written in PASCAL designed to find the number of binary trees possible for a given number of nodes is presented. The problem was found to be highly motivating and exciting for the group of introductory computer science students with whom it was used. (MP)
Publication Type: Journal Articles; Guides - Classroom - Learner; Guides - Classroom - Teacher
Education Level: N/A
Authoring Institution: N/A