'Traversing binary trees' diaporamas de présentation

Chapter 3 - 1

Chapter 3 - 1. Construction Techniques. Section 3.1 Inductively Defined Sets. To define a set S inductively is to do three things: Basis: Specify one or more elements of S. Induction: Specify one or more rules to construct elements of S from existing elements of S.

467 views • 35 slides

Discrete Structure

Discrete Structure. Li Tak Sing( ??? ) Lectures 14-15. Recursive functions for binary tree. Let "nodes" be the function that returns the number of nodes in a binary tree. Using the pattern matching form nodes(<>)=0 nodes(tree(L,a,R))=1+nodes(L)+nodes(R) Using the if-then-else-form

420 views • 32 slides

1.26k views • 29 slides