数据结构算法--二叉树--叶子节点查找

二叉树的结构：

 

0 二叉树叶子节点

class Node(object):
    def __init__(self, data, left=None, right=None):
        self.data = data
        self.left = left
        self.right = right

    def __str__(self):
        return str(self.data)

 

1. 静态建立二叉树

def create_bitree():
    m_nd = Node('M')
    n_nd = Node('N')
    l_nd = Node('L')
    k_nd = Node('K')
    j_nd = Node('J')
    e_nd = Node('E')
    g_nd = Node('G')
    # ----
    i_nd = Node('I', m_nd, n_nd)
    f_nd = Node('F', left=g_nd)
    h_nd = Node('H', right=f_nd)
    # ---
    c_nd = Node('D', h_nd, i_nd)
    b_nd = Node('B', e_nd, f_nd)
    # -----
    root = Node('A', b_nd, c_nd)
    return root

2. 叶子节点查找---非递归算法

def get_leaf(head):
    if not head:
        return None
    ret = []
    queue = [head]
    while queue:
        tmp = queue.pop(0)
        if not tmp.left and not tmp.right:
            ret.append(tmp.data)
        if tmp.left:
            queue.append(tmp.left)
        if tmp.right:
            queue.append(tmp.right)
    return ret

3. 递归 查找算法

 

 

4. 主函数

if __name__ == '__main__':
    head = create_bitree()
    ret1 = level_order1(head)
    print(ret1)
    ret2 = level_order2(head)
    print(ret2)
    print('===========================')
    print(get_parent(head, 'L'))
    print('+++++++++++++++++++')
    print(get_leaf(head))