Next q heap fun qa queue let rec loop no

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: ) : int =! …! in! loop q.head ! )! head! q tail! loop v! ( )! 1! next! no v! 2! next! fun (no: …) ->! begin match no with! | None -> 0! | Some n -> 1 + (loop n.next)! end! CIS120 / Spring 2012 24 Evalua@ng length Workspace Stack length 1 + (loop n.next)! q ( Heap fun (q:'a queue) ->! let rec loop (no:…) : int =! …! in! loop q.head ! )! head! q tail! loop v! ( )! 1! next! no n v! 2! next! fun (no: …) ->! begin match no with! | None -> 0! | Some n -> 1 + (loop n.next)! end! CIS120 / Spring 2012 25 Evalua@ng length Workspace 1+( Stack length )! q ( Heap fun (q:'a queue) ->! let rec loop (no:…) : int =! …! in! loop q.head ! )! head! q tail! loop v! ( )! 1! next! no n v! 2! next! fun (no: …) ->! begin match no with! | None -> 0! | Some n -> 1 + (loop n.next)! end! CIS120 / Spring 2012 26 Evalua@ng length Workspace Stack length begin match no with! | None ->...
View Full Document

Ask a homework question - tutors are online