NancyGu
diff --git a/‎.idea/workspace.xml‎
Lines changed: 56 additions & 66 deletions b/‎.idea/workspace.xml‎
Lines changed: 56 additions & 66 deletions
diff --git a/‎Target Offer/二叉搜索树的第k个结点.py‎
Lines changed: 35 additions & 0 deletions b/‎Target Offer/二叉搜索树的第k个结点.py‎
Lines changed: 35 additions & 0 deletions
diff --git a/‎Target Offer/序列化二叉树.py‎
Lines changed: 40 additions & 0 deletions b/‎Target Offer/序列化二叉树.py‎
Lines changed: 40 additions & 0 deletions
diff --git a/‎Target Offer/把二叉树打印成多行.py‎
Lines changed: 31 additions & 0 deletions b/‎Target Offer/把二叉树打印成多行.py‎
Lines changed: 31 additions & 0 deletions
@@ -0,0 +1,35 @@
+'''
+给定一颗二叉搜索树，请找出其中的第k大的结点。例如，
+    5
+   / \
+  3  7
+ /\ /\
+2 4 6 8 中，
+按结点数值大小顺序第三个结点的值为4。
+'''
+
+# -*- coding:utf-8 -*-
+class TreeNode:
+    def __init__(self, x):
+        self.val = x
+        self.left = None
+        self.right = None
+class Solution:
+    # 返回对应节点TreeNode
+    def __init__(self):
+        self.treeNode = []
+    def preOrder(self, pRoot):
+        if len(self.treeNode) < 0:
+            return None
+        if pRoot.left:
+            self.preOrder(pRoot.left)
+        self.treeNode.append(pRoot)
+        if pRoot.right:
+            self.preOrder(pRoot.right)
+    def KthNode(self, pRoot, k):
+        if k == 0 or pRoot == None:
+            return
+        self.preOrder(pRoot)
+        if len(self.treeNode) < k:
+            return None
+        return self.treeNode[k-1]
@@ -0,0 +1,40 @@
+'''
+请实现两个函数，分别用来序列化和反序列化二叉树。这里没有规定序列化的方式。
+'''
+
+# -*- coding:utf-8 -*-
+class TreeNode:
+    def __init__(self, x):
+        self.val = x
+        self.left = None
+        self.right = None
+class Solution:
+    def Serialize(self, root):
+        serializeStr = ''
+        if root == None:
+            return '#'
+        stack = []
+        while root or stack:
+            while root:
+                serializeStr += str(root.val) + ','
+                stack.append(root)
+                root = root.left
+            serializeStr += '#,'
+            root = stack.pop()
+            root = root.right
+        serializeStr = serializeStr[:-1]
+        return serializeStr
+
+    def Deserialize(self, s):
+        serialize = s.split(',')
+        tree, sp = self.deserialize(serialize, 0)
+        return tree
+
+    def deserialize(self, s, sp):
+        if sp >= len(s) or s[sp] == '#':
+            return None, sp + 1
+        node = TreeNode(int(s[sp]))
+        sp += 1
+        node.left, sp = self.deserialize(s, sp)
+        node.right, sp = self.deserialize(s, sp)
+        return node, sp
@@ -0,0 +1,31 @@
+'''
+从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。
+'''
+
+# -*- coding:utf-8 -*-
+class TreeNode:
+    def __init__(self, x):
+        self.val = x
+        self.left = None
+        self.right = None
+class Solution:
+    # 返回二维列表[[1,2],[4,5]]
+    def Print(self, pRoot):
+        if pRoot == None:
+            return []
+        nodes = []
+        tempNodes = []
+        result = []
+        nodes.append(pRoot)
+        while nodes:
+            levelResult = []
+            for node in nodes:
+                levelResult.append(node.val)
+                if node.left != None:
+                    tempNodes.append(node.left)
+                if node.right != None:
+                    tempNodes.append(node.right)
+            result.append(levelResult)
+            nodes = tempNodes
+            tempNodes = []
+        return result