CSSE 230
Data Structures and Algorithm Analysis
Small Programming HW 3 - 20 points
To Be Turned In
In this problem, you'll create another Binary Tree
constructor, one that constructs a Tree with Character data from two
pre-order lists: a string of data and a string of children. For
example, t = BinaryTree("abc", "200") would create a full tree of
height 1 with root = a and two children b and c, and t =
BinaryTree("cbad", "2L00") would create the minimum height-balanced
tree of height 2, with an in-order traversal of "abcd".
As a larger example, this tree was built from the strings, "ARGEDFKJHWS" and "R22200LL0L0":
This format should sound familiar - see HW4 and its solution
for more details. Note that this can construct any binary tree of
characters, not just BSTs. I am posting two hints here, but I strongly suggest that you try to develop an algorithm first before referring to them.
Upload your .java file(s) to this Moodle assignment when you finish.