'Inorder function' presentation slideshows

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

441 views • 32 slides