Part 1 - Build A tree given XML file in Memory
Given the provided input file [url removed, login to view] parse the XML file in order to generate a Tree in memory that matches tree.jpg. It must be traversable (if only doing part one a simple traverse function that prints out the tree representation is ok).
Part 2 - Write supporting functions to traverse tree to find decision value
Given an attributeList and a row of input such as
AttributeList = Bedrooms,Basement,Floorplan,Location,Visited
row = 4,No,open,South County,No
You would first find the attribute which corresponds to the root of the tree ( AttributeList ) which equals "Location". Then you look at the same index in row, ie: row to see a value of "South County". This means from location you follow the edge of "South County" which is split on the attribute Floorplan (AttributeList). You would grab row and see it has the value of "open" so you follow the edge named "open",this edge leads to the decision of No. Once a decision value has been reached stop traversing and report what it was (No or Yes).
You may choose to complete only Part1 or Part1 & Part2. Higher bids will be accepted if the code can be completed in a short amount of time. Price is negotiable, if 50/100$ is not enough place a higher bid etc.