def main(): tree = Generate_tree() tree_root = tree.create_tree() tree.print_structure() depth = Solution_55().tree_depth(tree_root) print('The depth of tree is %d.' % depth)
def main(): tree = Generate_tree() tree_root = tree.create_tree() tree.print_structure() s32c = Solution_32c() s32c.print_tree(tree_root)
def main(): tree = Generate_tree() tree_root = tree.create_tree() tree.print_structure() k = 4 result = Solution_54(k).kth_node(tree_root) print('The %dth largest node is %d' % (k, result.data_))
def main(): tree = Generate_tree() tree_root = tree.create_tree() tree.print_structure() s32 = Solution_32() val_ls = s32.printfromtoptobottom(tree_root) print('从上到下打印二叉树:', val_ls)
def main(): tree = Generate_tree() tree_root = tree.create_tree() tree.print_structure() # result = Solution_55b().is_balance_method_1(tree_root) result = Solution_55b().is_balance_method_2(tree_root) if result: print('The tree is a balance tree.') else: print('The tree is not a balance tree.')
def main(): tree = Generate_tree() tree_root = tree.create_tree() tree.print_structure() s34 = Solution_34() excep = 22 result = s34.findpath(tree_root, excep) if result: print('The paths which sum is %d are:' % excep) print(result) else: print('There do not exist a path.')
def main(): g_tree = Generate_tree() tree_root = g_tree.create_tree() g_tree.print_structure() doublelink, inv_doublelink = Solution_36b().convert(tree_root) print('双向链表升序遍历:') while doublelink: print(doublelink.data_, end=', ') doublelink = doublelink.right_ print('\n双向链表降序遍历:') while inv_doublelink: print(inv_doublelink.data_, end=', ') inv_doublelink = inv_doublelink.left_
def main(): tree_root = Generate_tree().create_tree() s28 = Solution_28() result = s28.is_symmetrical(tree_root) if result: print('The binarytree is symmetrical.') else: print('The binarytree is not symmetrical.')
def main(): tree_root = Generate_tree().create_tree() doublelink = Solution_36().convert(tree_root) # print(doublelink) while doublelink: print(doublelink.data_) doublelink = doublelink.right_
def main(): g_tree = Generate_tree() tree_root = g_tree.create_tree() g_tree.print_structure() s37 = Solution_37() s37.serialize(tree_root) print(s37.strings) tree = s37.deserialize(s37.strings) def recurse(node, level): s = '' if node is not None: s += recurse(node.right_, level + 1) s += '| ' * level s += str(node.data_) + ' \n' s += recurse(node.left_, level + 1) return s print('Tree structure:') print(recurse(tree, 0))