December 2021
Beginner
840 pages
47h 29m
English
Content preview from Programming Languages: Concepts and Implementation
Description
Description
Description
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
5.7 Constructing Additional Data Structures
Sophisticated, dynamic memory data structures, such as trees, are built from lists, which are just cons cells.
5.7.1 A Binary Tree Abstraction
Consider the following BNF specification of a binary tree:
The following sentences in the language defined by this grammar represent binary trees:
The following function accepts a binary tree as an argument and returns the number of internal and leaf nodes in the tree:
In this function, and in others we have seen ...