def test_tree_traverseBF_1child(): n = Node(0) n.add(20) t = Tree() t.root = n f = lambda n : print("data={0}".format(n.data)) t.traverseBF(f)
def main(): t = Tree() rt = Node(3) t.root = rt t.insert(7, rt) t.insert(1, rt) t.insert(5, rt) t.preorder(rt)
def test_tree_traverseDF_1sibling(): n = Node(0) n.add(20) n.add(21) t = Tree() t.root = n f = lambda n : print("data={0}".format(n.data)) t.traverseDF(f)
def test_tree_traverseBF_1direct_grandchild(): n = Node(0) n.add(20) n.add(21) n.children[0].add(30) t = Tree() t.root = n f = lambda n : print("data={0}".format(n.data)) t.traverseBF(f)
def test_tree_traverseDF_1both_grandchild1sibling(): n = Node(0) n.add(20) n.add(21) n.children[0].add(30) n.children[1].add(31) t = Tree() t.root = n f = lambda n : print("data={0}".format(n.data)) t.traverseDF(f)
def run(self, test): for x in test: if x.isdigit(): new = Node(x,None,None) self.push(new) self.leitura() else: node = Node(x) node.r = self.pop() node.l = self.pop() new = node self.push(new) raiz = Tree() raiz.root = self.pop() print("---------------") raiz.em_ordem(raiz.root) result = Interpreter() x = result.process(raiz.root) print(x) output = open('saida.txt', 'w') output.write(str(x)) output.close()
invalid_input = True break if invalid_input: print('Invalid input!') continue calc.set_infix_string(user_input) postfix = calc.get_postfix_notation() memory = [] i = 0 while len(postfix) > i: current = postfix[i] if current in operators_set: node = TreeNode(current) child2 = memory.pop() child1 = memory.pop() child1.set_parent(node) child2.set_parent(node) node.add_child(child1) node.add_child(child2) memory.append(node) else: node = TreeNode(current) memory.append(node) i += 1 tree = Tree('0') tree.root = memory.pop() print(tree.root) print('result:', calc.calculate()) print()
from tree import Tree, Node TESTTREE = Tree() TESTTREE.root = Node(42) NODES = (1, 2, 3, 4, 5, 6) def populate_tree(node, vals, left): if vals: node.left = Node(vals[0]) if len(vals) > 1: node.right = Node(vals[1]) if left: populate_tree(node.left, vals[2:], not left) else: populate_tree(node.right, vals[2:], left) populate_tree(TESTTREE.root, NODES, True)
def test_tree_traverseDF_root(): n = Node(0) t = Tree() t.root = n f = lambda n : print("data={0}".format(n.data)) t.traverseDF(f)
from tree import Tree,Node treeElements = map(int, raw_input("Enter sorted list").split()) tree = Tree() def createMinTree(low,high): if(low>high): return mid = (low + high)/2 data = treeElements[mid] node = Node(data) node.left = createMinTree(low,mid-1) node.right = createMinTree(mid+1,high) return node tree.root = createMinTree(0,len(treeElements)-1) tree.printInorder()