- 空树用空表[]表示
- 非空二叉树用包含三个元素的表[d,l,r]表示:
d表示存在根节点的元素
l和r是两棵子树,按同样的方式用两个list表示
例:
['A', ['B', [], []], ['C', ['D', ['F', [], []], ['G', [], []]],['E', ['H', [], []], ['I', [], []] ] ]
- 操作:
def BiTree(data, left, right): return [data, left, right]
def is_empty_BiTree(bitree): return bitree == []
def root(bitree): return bitree[0]
def leftch(bitree): return bitree[1]
def rightch(bitree): return bitree[2]
def set_root(bitree, data): betree[0] = data
def set_leftch(bitree, left): betree[1] = left
def set_rightch(bitree, right): betree[2] = right