Lec15

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: q.head! Stack length q ( Heap fun (q:'a queue) ->! let rec loop (no:…) : int =! …! in! loop q.head ! )! head! q tail! v! 1! next! v! 2! next! CIS120 / Spring 2012 16 [email protected] length Workspace let loop = fun (no: …) ->! begin match no with! | None -> 0! | Some n -> 1 + (loop n.next)! end! in! loop q.head! Stack length q ( Heap fun (q:'a queue) ->! let rec loop (no:…) : int =! …! in! loop q.head ! )! head! q tail! v! 1! next! v! 2! next! CIS120 / Spring 2012 17 [email protected] length Workspace let loop = fun (no: …) ->! begin match no with! | None -> 0! | Some n -> 1 + (loop n.next)! end! in! loop q.head! Stack length q ( Heap fun (q:'a queue) ->! let rec loop (no:…) : int =! …! in! loop q.head ! )! head! q tail! v! 1! next! v! 2! next! CIS120 / Spring 2012 18 [email protected] length Workspace Stack length loop q.head! q ( Heap fun (q:'a queue) ->! let rec loop (no:…) : i...
View Full Document

This document was uploaded on 11/24/2013.

Ask a homework question - tutors are online