Skip to content

Instantly share code, notes, and snippets.

@robertDurst
Created September 28, 2019 20:24
Show Gist options
  • Save robertDurst/efd8ca0f3d1be724a5e9b763a32addfa to your computer and use it in GitHub Desktop.
Save robertDurst/efd8ca0f3d1be724a5e9b763a32addfa to your computer and use it in GitHub Desktop.

Revisions

  1. Robert Durst created this gist Sep 28, 2019.
    46 changes: 46 additions & 0 deletions Tree.py
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,46 @@
    class Tree:
    def __init__(self, value):
    self.value = value
    self.left = None
    self.right = None


    def inorder(node):
    # fill in code
    return

    def preorder(node):
    # fill in code
    return

    def postorder(node):
    # fill in code
    return

    root = Tree("R")
    A = Tree("A")
    B = Tree("B")
    C = Tree("C")
    D = Tree("D")
    E = Tree("E")
    F = Tree("F")
    G = Tree("G")
    root.left = A
    root.right = B
    A.left = C
    C.right = D
    B.left = E
    B.right = F
    F.right = G

    """
    R
    A B
    C E F
    D G
    """

    print "These should all be true!"
    print inorder(root) == "CDAREBFG"
    print preorder(root) == "RACDBEFG"
    print postorder(root) == "DCAEGFBR"