Counting Strictly Binary Rooted Trees: Specialized Data Structures.

King, Ronald S.

Notes FAQ Contact Us

Back to results

Peer reviewed

ERIC Number: EJ263584

Record Type: Journal

Publication Date: 1982

Pages: N/A

Abstractor: N/A

ISBN: N/A

ISSN: N/A

EISSN: N/A

Available Date: 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)

Descriptors: College Mathematics, Computer Programs, Computer Science Education, Higher Education, Mathematical Concepts, Mathematical Enrichment, Mathematics Instruction, Problem Solving, Programing

Publication Type: Journal Articles; Guides - Classroom - Learner; Guides - Classroom - Teacher

Education Level: N/A

Audience: Practitioners

Language: English

Sponsor: N/A

Authoring Institution: N/A

Grant or Contract Numbers: N/A

Author Affiliations: N/A