Set up LinkedBinaryTree class (using C++ code fragment or Java code) and then create a simple test driver to perform some basic operations on a binary tree of strings (can use names). Once it is working correctly, modify LinkedBinaryTree to support in-order traversal. It is best to modify positions0 to perform in-order traversal. Lab question 1: Provide pre-order traversal, in-order traversal, post-order traversal, and level-order traversal for the following binary tree. D E Lab question 2: Distinguish the two terms associated with trees: height and depth