Week $15$ Lab Activities

This lab has been designed for you to practice implementing recursive functions and introduce Binary Search Trees.

Part I Recursion with doubly linked list

The $"$DLL ist. $h"$ file includes the definition of a doubly linked list class. Most functions have been implemented in the "DLList.cpp$"$ file to support the testing of the following functions. No loop is allowed in implementing any of these functions.

unsigned count$($Node$*$ p$,$ Element value$)$ const;

This private member function of the DLList class shall return the number of times a given value occurs in the list starting from the Node pointed by $p.$

unsigned count $($Element c$)$ const;

This public member function of the DLList class shall return the number of times a given value occurs in the invoking object by calling the private count function.

bool isPalindrome$($Node$*$ first, Node$*$ last$)$ const;

This private member function of the DLList class shall return true if the elements in the Nodes between the first and last pointers read the same forward and backward.

bool isPalindrome$()$ const;

This public member function of the DLList class shall call the private isPalindrome function so that it would return true if the elements in the invoking object read the same forward and backward.

In the "main.cpp$"$ file add statements to test the count and isPalindrome function.

Capture sample runs of your program to demonstrate thorough testing of the functions.

Part II Tree terminology

This part of the lab does not involve any programming. It is designed to help you review related concepts for trees.