You cannot submit for this problem because the homework's deadline is due.

Dynamic Memory Allocation, overloading, default arguments, destructor, recursion

Background

A tree ADT organizes and manages data in a hierarchical tree structure. An n-ary tree is a generalization of a binary tree where any node in the tree has exactly one parent, except one node called root node, and any node may have zero up to n children.

Description

Please refer to the description file on Canvas.

Submission

Please compress node.h and node.cpp and submit the compressed file on JOJ.

Due Date

Out: 00:00 am, July 11, 2023; Due: 23:59 pm, July 18, 2023

This Lab is optional. You are at liberty to test your work via JOJ, but it will not be graded as an assignment in this course.