Smap

Choose the version you want to view.

Current version:Version message:

Working on Remove

Click on a tag to show all related programs.

tree bst binarysearch

Click on the badge to open the comment window for viewing and writing comments.

No comments yet.

Created by nikobro on April 20, 2023 (last modified on April 24, 2023)

0 users favorited this

Description: -

Source code (Latest version):

-- This is a source code template for Curry programs.

data Tree a = Empty | Node a (Tree a) (Tree a) deriving (Show)

tree = Node 10 Empty Empty

Insert :: (Ord a) => a -> Tree a -> Tree a
Insert x Empty = Node x Empty Empty
Insert x (Node y left right) | x == y = (Node y left right)
                             | x < y = Node y (Insert x left) right
                             | x > y = Node y left (Insert x right)
                             
Contains :: (Ord a) => a -> Tree a -> Bool
Contains x Empty = False
Contains x (Node y left right) | x == y = True
                               | x < y = Contains x left
                               | x > y = Contains x right

tree2 = Insert 9 (Insert 12 (Insert 13 tree))

Remove2 x (Node x Empty Empty) = Empty
Remove2 x (Node x left Empty) = left
Remove2 x (Node x Empty right) = right

--Remove :: (Ord a) => a -> Tree a -> Tree a
Remove x Empty = Empty
Remove x (Node y left right) | x == y = Remove2 x (Node y left right)
                             | x < y = (Node y (Remove x left) right)
                             | x > y = (Node y left (Remove x right))

main = Contains 13 tree2-- put here the main expression of your program

Options

Versions

3 versions

Tags

3 tags

Comments

0 comments »

Binary Tree

implemented in Curry