def test(): s = Solution() node = list_to_tree([1, 2, None, 3]) s.flatten(node) print(tree_to_list(node)) node = list_to_tree([1, 2, 3, 4, 5, 6, 7, 8, None, None, 9]) s.flatten(node) print(tree_to_list(node))
def populate_list(self): self.ui.treeFileList.clear() tree_items = tree.list_to_tree(script_map.SCRIPT_MAP) for item in tree_items: self.ui.treeFileList.addTopLevelItem(item)
def populate_list(self): self.ui.treeFileList.clear() reload(script_map) tree_items = tree.list_to_tree(script_map.SCRIPT_MAP) for item in tree_items: self.ui.treeFileList.addTopLevelItem(item)
def populate_list(self): self.ui.treeFileList.clear() tree_items = list_to_tree(SCRIPT_MAP) for item in tree_items: if item.text(0) == "EBOOT Text": continue # We want check boxes here, but for them to show up, # we actually have to set the state to ~something~. # So recursively set everything to unchecked, then add it. item.setCheckState(0, Qt.Qt.Unchecked) self.recursiveChecks(item) self.ui.treeFileList.addTopLevelItem(item)
# Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None import tree class Solution(object): def invertTree(self, root): if not root: return root temp = root.left root.left = root.right root.right = temp if root.left: self.invertTree(root.left) if root.right: self.invertTree(root.right) return root root = tree.list_to_tree([4, 2, 7, 1, 3, 6, 9]) s = Solution() s.invertTree(root) print tree.tree_to_list(root)