depth :: Tree1c -> Int
depth (Node1c _ t1 t2) = 1 + maximum [(depth t1), (depth t2)]
depth :: Tree1c -> Int
depth (Node1c _ t1 t2) = 1 + maximum [(depth t1), (depth t2)]
depth (Node1c _ t1 t2) = 1 + maximum [(depth t1), (depth t2)]