• Given a value aVal and two binary trees aLeftChild and aRightChild, returns a binary tree whose root is labeled by aVal and with both trees as its children.

    Parameters

    • aVal: any

      a value at the root of the tree

    • aLeftChild: Tree<any>

      a left child

    • aRightChild: Tree<any>

      a right child

    Returns Tree<any>