根到葉節點的路徑

 class Node:

  def __init__(self,key):

    self.left = None

    self.right = None

    self.val = key

  

def find_paths(root,path):

  if root is None:

    return

  path.append(root.val)

  

  if root.left is None and root.right is None:

    print(' ->'.join(map(str,path)))

  

  find_paths(root.left,path)

  find_paths(root.right,path)

  

  path.pop()

root = Node(50)

root.left = Node(30)

root.right = Node(70)

root.left.left = Node(20)

root.left.left.left = Node(15)

root.left.left.right = Node(25)

root.left.right = Node(40)

root.right.left = Node(60)

root.right.right = Node(80)

find_paths(root,[])