python 二叉树遍历

class node:
    def __init__(self,x=None,left=None,right=None):
        self.val=x
        self.left=left
        self.right=right
def prewave(root):
    if root==None:
        return
    prewave(root.left)
    prewave(root.right)
    print(root.val,end=' ')


if __name__=='__main__':
    root=node('c',node('d',node('f',node('x')),node('g')),node('a'))
    print("zhong序遍历")
    prewave(root)