{-# LANGUAGE Safe #-}
{-# OPTIONS_GHC -Wno-missing-export-lists #-}
{-# OPTIONS_GHC -Wno-missing-exported-signatures #-}
{-# OPTIONS_GHC -Wno-missing-local-signatures #-}
{-# OPTIONS_GHC -Wno-missing-signatures #-}
{-# OPTIONS_HADDOCK hide #-}

module Data.Tree.BST.Unsafe.Examples where

import Data.Tree.BST.Unsafe
  ( deleteBST,
    emptyBST,
    insertBST,
    lookupBST,
  )
import Prelude ()

-- | Test Balanced Binary Tree
bste :: BST a
bste = BST a
forall a. BST a
emptyBST

bstt1 :: BST Char
bstt1 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
20 Char
'f' BST Char
forall a. BST a
bste

bstt2 :: BST Char
bstt2 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
60 Char
'a' BST Char
bstt1

bstt3 :: BST Char
bstt3 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
30 Char
'l' BST Char
bstt2

bstt4 :: BST Char
bstt4 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
50 Char
'g' BST Char
bstt3

bstt5 :: BST Char
bstt5 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
0 Char
'o' BST Char
bstt4

bstt6 :: BST Char
bstt6 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
70 Char
'p' BST Char
bstt5

bstt7 :: BST Char
bstt7 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
70 Char
'u' BST Char
bstt6

bstt8 :: BST Char
bstt8 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
75 Char
'a' BST Char
bstt7

bstt9 :: BST Char
bstt9 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
80 Char
'a' BST Char
bstt8

bstt10 :: BST Char
bstt10 = Int -> Char -> BST Char -> BST Char
forall a. Show a => Int -> a -> BST a -> BST a
insertBST Int
90 Char
'a' BST Char
bstt9

l1 :: Maybe Char
l1 = Int -> BST Char -> Maybe Char
forall a. Int -> BST a -> Maybe a
lookupBST Int
30 BST Char
bstt8

-- | Nothing: key 10 is not in the tree bstt8
n :: Maybe Char
n = Int -> BST Char -> Maybe Char
forall a. Int -> BST a -> Maybe a
lookupBST Int
10 BST Char
bstt8

bstt11 :: BST Char
bstt11 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
20 BST Char
bstt8

bstt12 :: BST Char
bstt12 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
60 BST Char
bstt8

bstt13 :: BST Char
bstt13 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
30 BST Char
bstt8

bstt14 :: BST Char
bstt14 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
50 BST Char
bstt8

bstt15 :: BST Char
bstt15 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
0 BST Char
bstt8

bstt16 :: BST Char
bstt16 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
70 BST Char
bstt8

bstt17 :: BST Char
bstt17 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
70 BST Char
bstt8

bstt18 :: BST Char
bstt18 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
75 BST Char
bstt8

bstt19 :: BST Char
bstt19 = Int -> BST Char -> BST Char
forall a. Int -> BST a -> BST a
deleteBST Int
21 BST Char
bstt8

bstt20 :: BST a
bstt20 = Int -> BST a -> BST a
forall a. Int -> BST a -> BST a
deleteBST Int
21 BST a
forall a. BST a
bste