Descriptor
| College Mathematics | 1 |
| Computer Programs | 1 |
| Computer Science Education | 1 |
| Higher Education | 1 |
| Mathematical Concepts | 1 |
| Mathematical Enrichment | 1 |
| Mathematics Instruction | 1 |
| Problem Solving | 1 |
| Programing | 1 |
Source
| Mathematics and Computer… | 1 |
Author
| King, Ronald S. | 1 |
Publication Type
| Guides - Classroom - Learner | 1 |
| Guides - Classroom - Teacher | 1 |
| Journal Articles | 1 |
Education Level
Audience
| Practitioners | 1 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedKing, Ronald S. – Mathematics and Computer Education, 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)
Descriptors: College Mathematics, Computer Programs, Computer Science Education, Higher Education
