Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Learn more about F# at http://fsharp.org
- // See the 'F# Tutorial' project for more help.
- type rbdrzewo =
- | LiscB of int
- | LiscR of int
- | Korzen of int*rbdrzewo*rbdrzewo
- let rec szukajCzarnych (drzewo:rbdrzewo) : rbdrzewo list =
- match drzewo with
- | LiscB(n) -> LiscB(n)::[]
- | LiscR(n) -> []
- | Korzen(n,left,right) -> List.append (szukajCzarnych left) (szukajCzarnych right)
- [<EntryPoint>]
- let main argv =
- let drzewo = Korzen(2,Korzen(3,LiscB(3),LiscR(2)),Korzen(5,LiscB(7),Korzen(8,LiscR(10),LiscB(10))));
- let wynik = szukajCzarnych drzewo;
- for x in wynik do printfn "%A" <| x
- printfn "%A" argv
- 0 // return an integer exit code
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement