Chapter 4 Trees and Graphs

本文链接：https://blog.csdn.net/cheng_tian/article/details/7772105

这篇博客介绍了如何根据有序数组创建一棵具有最小高度的二叉树。提供了两种构造方法，一种使用广度优先搜索（BFS），另一种使用递归实现。在每种方法中，都展示了如何将数组元素转化为二叉树节点，并通过层次遍历展示生成的二叉树。

摘要由CSDN通过智能技术生成

Problem 4.3 Given a sorted (increasing) array, write an algorithm to create a binary tree with minimal height.

Seems that we should construct a complete binary tree.

from queue import *
class binary_tree_node:
    def __init__(self, value = None):
        self.value = value
        self.left = None
        self.right = None
def construct_min_btree(array):
    # Keep track of current element in the array
    i = 0
    # Construct while doing BFS
    q = queue()
    root = binary_tree_node(array[i])
    i += 1
    q.enqueue(root)
    while not q.is_empty():
        n = q.dequeue()
        # Construct left child
        n.left = binary_tree_node(array[i])
        i += 1
        if i == len(array):
            break
        q.enqueue(n.left)
        # Construct right child
        n.right = binary_tree_node(array[i])
        i += 1
        if i ==  len(array):
            break
        q.enqueue(n.right)
    return root


# Test case
if __name__ == "__main__":
    array = [i for i in range(0, 80)]
    root = construct_min_btree(array)
    # Print the binary tree in level-order
    q = queue()
    q.enqueue(root)
    current_level = 0
    num_in_current_level = 2**current_level
    while not q.is_empty():
        n = q.dequeue()
        print n.value,
        if n.left != None:
            q.enqueue(n.left)
        if n.right != None:
            q.enqueue(n.right)
        num_in_current_level -= 1
        # End of a level
        if num_in_current_level == 0:
            current_level += 1
            num_in_current_level = 2**current_level
            print "\n"

The solution on the answer page constructs a binary search tree with recursion.

from queue import *
class binary_tree_node:
    def __init__(self, value = None):
        self.value = value
        self.left = None
        self.right = None
def construct_min_btree(array, start, end):
    if start > end:
        return
    mid = (start + end)/2
    n = binary_tree_node(array[mid])
    n.left = construct_min_btree(array, start, mid - 1)
    n.right = construct_min_btree(array, mid + 1, end)
    return n

# Test case
if __name__ == "__main__":
    array = [i for i in range(0, 8)]
    root = construct_min_btree(array, 0, 7)
    # Print the binary tree in level-order
    q = queue()
    q.enqueue(root)
    current_level = 0
    num_in_current_level = 2**current_level
    while not q.is_empty():
        n = q.dequeue()
        print n.value,
        if n.left != None:
            q.enqueue(n.left)
        if n.right != None:
            q.enqueue(n.right)
        num_in_current_level -= 1
        # End of a level
        if num_in_current_level == 0:
            current_level += 1
            num_in_current_level = 2**current_level
            print "\n"

Chapter 4 Trees and Graphs - 4.3