Advertisement
Guest User

Untitled

a guest
May 20th, 2015
234
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
F# 0.51 KB | None | 0 0
  1. let rec countNodes = function
  2. |Node(v,[]) -> 1
  3. |Node(v,l) -> 1 + foldl (fun (b,x) -> b + countNodes(x))(0,l);;
  4.  
  5. (*10.*)
  6. let rec numDosen = function
  7. |Node(v,[]) -> 1
  8. |Node(v,l) -> foldl (fun (b,x) -> b + numDosen(x))(0,l);;
  9.  
  10. (*11.*)
  11. let rec extNode = function
  12. |Node(v,[])-> [v]
  13. |Node(v,l)-> foldl(fun (h,x) -> h @ extNode(x)) ([],l);;
  14.  
  15. let rec daftarDosen = function
  16. |(Node(v,[]),n) -> []
  17. |(Node(v,l),n) -> if n = v then quik(extNode(Node(v,l)),[]) else foldl(fun (h,x) -> h @ daftarDosen(x,n)) ([],l);;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement