{"rsdb":{"rid":"239776","subhead":"","postdate":"0","aid":"165219","fid":"54","uid":"1","topic":"1","content":"

Python\u5b9e\u73b0\u4e8c\u53c9\u6811\u7684\u904d\u5386<\/strong><\/p>

class BinaryTree(object):
    def __init__(self, value=None, left=None, right=None):
        self.value = value
        self.left = left
        self.right = right
 
    def rebuild(self, preOrder, inOrder):
        """
        \u6839\u636e\u524d\u5e8f\u5217\u8868\u548c\u4e2d\u5e8f\u5217\u8868,\u91cd\u5efa\u4e8c\u53c9\u6811
        :param preOrder: \u524d\u5e8f\u5217\u8868
        :param inOrder: \u4e2d\u5e8f\u5217\u8868
        :return: \u4e8c\u53c9\u6811
        """
        if preOrder == None or inOrder == None or len(preOrder) <=0 or len(inOrder) <=0 \\
                or len(preOrder) != len(inOrder):
            return None
        cur = BinaryTree(preOrder[0])
        index = inOrder.index(preOrder[0])
        cur.left = self.rebuild(preOrder[1: index+1], inOrder[:index])
        cur.right = self.rebuild(preOrder[index+1:], inOrder[index+1:])
        return cur
 
    def preOrder(self, tree):
        """
        \u524d\u5e8f\u904d\u5386
        :param tree:
        :return:
        """
        if tree == None:
            return None
        print(tree.value, end=' ')
        self.preOrder(tree.left)
        self.preOrder(tree.right)
 
    def preOrderLoop(self, tree):
        """
        \u524d\u5e8f\u904d\u5386\u7684\u5faa\u73af\u5b9e\u73b0
        :param tree:
        :return:
        """
        if tree == None:
            return None
        lst = []
        node = tree
        while node != None or len(lst) > 0:
            if node != None:
                lst.append(node)
                print(node.value, end=' ')
                node = node.left
            else:
                item = lst[len(lst)-1]
                lst = lst[:-1]
                node = item.right
 
    def inOrder(self, tree):
        """
        \u4e2d\u5e8f\u904d\u5386
        :param tree:
        :return:
        """
        if tree == None:
            return None
        self.inOrder(tree.left)
        print(tree.value, end=' ')
        self.inOrder(tree.right)
 
    def inOrderLoop(self, tree):
        """
        \u4e2d\u5e8f\u904d\u5386\u5faa\u73af\u5b9e\u73b0
        :param tree:
&nb","orderid":"0","title":"Python\u5b9e\u73b0\u4e8c\u53c9\u6811\u7684\u904d\u5386(\u4e00)","smalltitle":"","mid":"0","fname":"linux\u7f16\u7a0b\u57fa\u7840","special_id":"0","bak_id":"0","info":"0","hits":"2599","pages":"2","comments":"0","posttime":"2017-10-18 09:07:54","list":"1508288874","username":"admin","author":"","copyfrom":"","copyfromurl":"","titlecolor":"","fonttype":"0","titleicon":"0","picurl":"https:\/\/www.cppentry.com\/upload_files\/","ispic":"0","yz":"1","yzer":"","yztime":"0","levels":"0","levelstime":"0","keywords":"Python<\/A> \u5b9e\u73b0<\/A>","jumpurl":"","iframeurl":"","style":"","template":"a:3:{s:4:\"head\";s:0:\"\";s:4:\"foot\";s:0:\"\";s:8:\"bencandy\";s:0:\"\";}","target":"0","ip":"113.108.110.181","lastfid":"0","money":"0","buyuser":"","passwd":"","allowdown":"","allowview":"","editer":"","edittime":"0","begintime":"0","endtime":"0","description":"Python\u5b9e\u73b0\u4e8c\u53c9\u6811\u7684\u904d\u5386","lastview":"1709240912","digg_num":"4783","digg_time":"1711655012","forbidcomment":"0","ifvote":"0","heart":"","htmlname":"","city_id":"0"},"page":"1"}