Python編程之資料結構與演算法練習_009

來源:互聯網
上載者:User

標籤:python編程   搜尋   練習   init   als   lis   int   first   搜尋二叉樹   

練習內容:

判斷一棵樹是否是搜尋二叉樹。

本文內容提要:

1.建立類實現雙向鏈表及基本棧結構。
2.建立類表示二叉樹。
3.判斷一棵樹是否是搜尋二叉樹的遞迴與非遞迴實現。
4.簡單測試,驗證正確性。

1.建立類實現雙向鏈表及基本棧結構。代碼如下:
class DoubleLinkedList:    class Node:        def __init__(self, data):            self._data = data            self._next = None            self._pre = None    def __init__(self):        self.__head = DoubleLinkedList.Node("__head")        self.__tail = DoubleLinkedList.Node("__tail")        self.__head._next = self.__tail        self.__tail._pre = self.__head    def append(self, data):        node = DoubleLinkedList.Node(data)        self.__tail._pre._next = node        node._pre = self.__tail._pre        self.__tail._pre = node        node._next = self.__tail    def remove(self, data):        node = self.__head        while node != self.__tail:            if node._data == data:                node._pre._next = node._next                node._next._pre = node._pre                break            node = node._next    def pop(self):        node = self.__tail._pre        if node != self.__head:            node._pre._next = node._next            node._next._pre = node._pre            node._next = None            node._pre = None            return node._data        return None    def is_empty(self) -> bool:        return self.__head._next == self.__tail    def iternodes(self) -> None:        node = self.__head._next        while node != self.__tail:            yield node._data            node = node._next    def add_last(self, data: object) -> None:        self.append(data)    def poll_first(self):        node = self.__head._next        if node != self.__tail:            self.__head._next = node._next            node._next._pre = self.__head            node._next = None            node._pre = None            return node._data        return None    def poll_last(self):        return self.pop()    def peek_first(self):        node = self.__head._next        if node != self.__tail:            return node._data        return None    def peek_last(self):        node = self.__tail._pre        if node != self.__head:            return node._data        return Noneclass Stack:    def __init__(self):        self.__dlnklst = DoubleLinkedList()    def pop(self):        return self.__dlnklst.pop()    def add(self, data):        self.__dlnklst.append(data)    def push(self, data):        return self.__dlnklst.append(data)    def peek(self):        return self.__dlnklst.peek_last()    def poll(self):        return self.__dlnklst.poll_last()    def is_empty(self):        return self.__dlnklst.is_empty()
2.建立類表示二叉樹。代碼如下:
class Node:    def __init__(self, data):        self.__data = data        self.__left = None        self.__right = None    @property    def data(self):        return self.__data    @property    def left(self):        return self.__left    @left.setter    def left(self, node):        self.__left = node    @property    def right(self):        return self.__right    @right.setter    def right(self, node):        self.__right = node
3.判斷一棵樹是否是搜尋二叉樹的遞迴與非遞迴實現。代碼如下:
def is_bst_recur(head, pre=None):    if not head:        return True    cur = head    if not is_bst_recur(cur.left, pre):        return False    if pre and pre.data > cur.data:        return False    pre = cur    return is_bst_recur(cur.right, pre)def is_bst_unrecur(head):    if not head:        return    stack = Stack()    pre = None    while not stack.is_empty() or head:        if head:            stack.add(head)            head = head.left        else:            head = stack.pop()            if pre and pre.data > head.data:                return False            pre = head            head = head.right    else:        return True
4.簡單測試,驗證正確性。代碼如下:
if __name__ == "__main__":    # BST    head1 = Node(9)    head1.left = Node(8)    head1.right = Node(10)    head1.left.left = Node(7)    head1.left.right = Node(9)    head1.right.left = Node(9)    head1.right.right = Node(11)    print(is_bst_recur(head1))  # True    print(is_bst_unrecur(head1)) # True    # Not BST    head2 = Node(9)    head2.left = Node(8)    head2.right = Node(1)    head2.left.left = Node(7)    head2.left.right = Node(9)    head2.right.left = Node(9)    head2.right.right = Node(11)    print(is_bst_recur(head2))  # False    print(is_bst_unrecur(head2)) # False

 

Python編程之資料結構與演算法練習_009

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.