| Copyright | Copyright (C) 2021 Yoo Chung |
|---|---|
| License | GPL-3.0-or-later |
| Maintainer | dev@chungyc.org |
| Safe Haskell | Safe-Inferred |
| Language | GHC2021 |
Solutions.P63
Description
Some solutions to Problems.P63 of Ninety-Nine Haskell Problems.
Synopsis
- completeBinaryTree :: Int -> Tree ()
- isCompleteBinaryTree :: Tree a -> Bool
Documentation
completeBinaryTree :: Int -> Tree () Source #
Construct a complete binary tree with the given number of nodes.
isCompleteBinaryTree :: Tree a -> Bool Source #
Write a function to return whether a tree is a complete binary tree.