there n node arrange circle number 1 n clockwise order you give binary string s length nYour task construct tree give n node satisfy condition report tree exist for node 1 le le n degree node s_i 0 odd s_i 1 no edge tree intersect internally circle the edge allow intersect circumference note edge draw straight line segment for example edge u v tree draw line segment connect u v circleA tree n node connect graph n 1 edge