Python 二叉树的遍历
二叉树初始化
# Definition for a binary tree node.
class node:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
#示例如何初始化一个二叉树
root = node(5)
root.left = node(7)
root.right = node(8)
root.left.left = node(3)
root.left.right = node(4)
root.left.right.left = node(9)
二叉树可视化:
前序遍历
递归
def preorderTraversal(root, res=[]):
if not root:
return res
res.append(root.val)#根左右
preorderTraversal(root.left, res)
preorderTraversal(root.right, res)
return res
前序遍历递归输出:
print(preorderTraversal(root,res=[]))
[5, 7,