<gh_stars>0
# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#114. Flatten Binary Tree to Linked List
#Given a binary tree, flatten it to a linked list in-place.
#For example, given the following tree:
#    1
#   / \
#  2   5
# / \   \
#3   4   6
#The flattened tree should look like:
#1
# \
#  2
#   \
#    3
#     \
#      4
#       \
#        5
#         \
#          6
## Definition for a binary tree node.
## class TreeNode(object):
##     def __init__(self, x):
##         self.val = x
##         self.left = None
##         self.right = None
#class Solution(object):
#    def flatten(self, root):
#        """
#        :type root: TreeNode
#        :rtype: void Do not return anything, modify root in-place instead.
#        """



# Time Is Money
# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#114. Flatten Binary Tree to Linked List
#Given a binary tree, flatten it to a linked list in-place.
#For example, given the following tree:
#    1
#   / \
#  2   5
# / \   \
#3   4   6
#The flattened tree should look like:
#1
# \
#  2
#   \
#    3
#     \
#      4
#       \
#        5
#         \
#          6
## Definition for a binary tree node.
## class TreeNode(object):
##     def __init__(self, x):
##         self.val = x
##         self.left = None
##         self.right = None
#class Solution(object):
#    def flatten(self, root):
#        """
#        :type root: TreeNode
#        :rtype: void Do not return anything, modify root in-place instead.
#        """



# Time Is Money
# DRUNKWATER TEMPLATE(add description and prototypes) # Question Title and Description on leetcode.com # Function Declaration and Function Prototypes on leetcode.com #114. Flatten Binary Tree to Linked List #Given a binary tree, flatten it to a linked list in-place. #For example, given the following tree: #    1 #   / \ #  2   5 # / \   \ #3   4   6 #The flattened tree should look like: #1 # \ #  2 #   \ #    3 #     \ #      4 #       \ #        5 #         \ #          6 ## Definition for a binary tree node. ## class TreeNode(object): ##     def __init__(self, x): ##         self.val = x ##         self.left = None ##         self.right = None #class Solution(object): #    def flatten(self, root): #        """ #        :type root: TreeNode #        :rtype: void Do not return anything, modify root in-place instead. #        """ # Time Is Money