# class puzzleTree:
#     def __init__(self, node):
#         self.root=node
#         self.left=None
#         self.right=None
#         self.height=-1
#         self.firstKey=node.data.B
#         self.secondKey=node.data.H
#         nnode=node.data.order.copy()
#         nnode[self.firstKey]=0
#         self.thirdKey=nnode

#     def fix(self):
#         pass

#     def insert(self, node):
#         if not self.root:
#             self.root=node