Sample Input files for finding maximum independent set in Tree

Normal Binary Trees

• 30->10->50->#->#->#->20->45->#->#->35->#-># 
• 1->2->#->#->3->4->#->#->5->6->#->#-># 
• 1->2->8->#->#->#->3->4->#->9->#->#->5->6->#->#->#

Full Binary Trees

• 1->2->4->8->#->#->9->#->#->5->10->#->#->11->#->#->3->6->12->#->#->13->#->#->7->14->#->#->15->#-># 
• 21->2->4->18->#->#->9->#->#->5->10->#->#->1->#->#->13->36->12->#->#->14->#->#->7->4->#->#->35->#->#

Right Skewed Binary Trees

• 68->#->70->#->2->#-># 
• 8->#->2->#->4->#->6->#->12->#->3->#->1->#->#

Left Skewed Binary Trees

• 70->4->2->81->27->1->4->14->#->#->#->#->#->#->#->#->#

Note:

The node values are arranged using preorder traversal. # stand for NULL value.