in C$++$

Your journey continues through the Binary Tree Forest, where the path to the Amulet is

hidden within a network of Binary Search Trees $($BSTs$).$ You must implement and utilize

BSTs to navigate the forest and uncover hidden secrets$.$

Tasks:

$1.$ Binary Search Tree $($BST$)$ Implementation:

$-$ Create a BST class that supports:

$-$ Insertion, deletion, and search operations.

$-$ Finding minimum and maximum values.

$-$ Calculating tree height and the depth of nodes.

$-$ Checking if the tree is balanced.

$2.$ Tree Traversal Methods:

$-$ Implement both recursive and iterative versions of:

$-$ Inorder, preorder, and postorder traversals.

$-$ Level$-$order traversal using a queue.

$-$ Use tree traversals to decode messages or find the correct path through the

forest.

$3.$ Pathfinding and Puzzle Solving:

$-$ Represent the forest as a complex tree where each node contains a puzzle or

riddle.

$-$ Solve each puzzle to proceed to the next node, with backtracking implemented to

handle dead ends