Esempi in Python per build_oj_binary_tree

Esempio n. 1

File: house_robber_iii.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([3,2,3,'#',3,'#',1])
    result = Solution().rob(root)
    print result

    root = build_oj_binary_tree([3,4,5,1,3,'#',1])
    result = Solution().rob(root)
    print result

    root = build_oj_binary_tree([4,1,'#',2,'#',3])
    result = Solution().rob(root)
    print result

Esempio n. 2

File: binary_tree_postorder_traversal.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([1,'#',2,3])
    result = Solution().postorderTraversal(root)
    print result

Esempio n. 3

File: kth_smallest_element_in_a_BST.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    from utils import build_oj_binary_tree
    root, k = build_oj_binary_tree([3,2,4,1]), 2
    result = Solution().kthSmallest(root, k)
    print result

Esempio n. 4

File: count_complete_tree_nodes.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([1,2,3,4,5])
    postorder(root)
    result = Solution().countNodes(root)
    print result

Esempio n. 5

File: flatten_binary_tree_to_linked_list.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    Solution().flatten(None)

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([1,2,5,3,4,'#',6])
    Solution().flatten(root)
    inorder(root)

Esempio n. 6

File: binary_tree_zigzag_level_order_traversal.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([3,9,20,'#','#',15,7])
    print '->'.join(str(n) for n in postorder_traversal(root))

    result = Solution().zigzagLevelOrder(root)
    print result

Esempio n. 7

File: validate_binary_search_tree.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([1,'#',2,3])
    result = Solution().isValidBST(root)
    print preorder(root), result

    root = build_oj_binary_tree([2,1,3])
    result = Solution().isValidBST(root)
    print preorder(root), result

    root = build_oj_binary_tree([1,1])
    result = Solution().isValidBST(root)
    print preorder(root), result

    root = build_oj_binary_tree([10,5,15,'#','#',6,20])
    result = Solution().isValidBST(root)
    print preorder(root), result

Esempio n. 8

File: sum_root_to_leaf_numbers.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    result = Solution().sumNumbers(None)
    print result

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([1,2,3])
    result = Solution().sumNumbers(root)
    print result

Esempio n. 9

File: lowest_commona_ancestor_of_a_binary_tree.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([3,5,1,6,2,0,8,'#','#',7,4])
    print '->'.join(str(n) for n in preorder(root))
    p = root.left
    q = root.right
    q = root.left.right.right
    result = Solution().lowestCommonAncestor(root, p, q)
    print result.val

Esempio n. 10

File: binary_tree_right_side_view.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath

    sys.path.append(join("..", "common"))

    result = Solution().rightSideView(None)
    print result

    from utils import build_oj_binary_tree

    root = build_oj_binary_tree([1, 2, 3, 4])
    result = Solution().rightSideView(root)
    print result

Esempio n. 11

File: construct_binary_tree_from_preorder_and_inorder_traversal.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath
    sys.path.append(join('..', 'common'))

    from utils import build_oj_binary_tree
    root = build_oj_binary_tree([1,2,3,'#',4,5])

    preorder = preorder_traversal(root)
    inorder = inorder_traversal(root)
    postorder = postorder_traversal(root)

    print '->'.join(str(n) for n in preorder)
    print '->'.join(str(n) for n in inorder)
    print '->'.join(str(n) for n in postorder)

    result = Solution().buildTree(preorder, inorder)
    print '->'.join(str(n) for n in postorder_traversal(result))

Esempio n. 12

File: construct_binary_tree_from_inorder_and_postorder_traversal.py Progetto: theeric80/LeetCode

def main():
    import sys
    from os.path import join, abspath

    sys.path.append(join("..", "common"))

    from utils import build_oj_binary_tree

    root = build_oj_binary_tree([1, 2, 3, "#", 4, 5])

    preorder = preorder_traversal(root)
    inorder = inorder_traversal(root)
    postorder = postorder_traversal(root)

    print "->".join(str(n) for n in preorder)
    print "->".join(str(n) for n in inorder)
    print "->".join(str(n) for n in postorder)

    result = Solution().buildTree(inorder, postorder)
    print "->".join(str(n) for n in preorder_traversal(result))