二叉树查找算法代码2

Author: qiwsir

binary_tree2.py

@@ -0,0 +1,125 @@
+#! /usr/bin/env python
+#coding:utf-8
+
+# The code is from:http://code.activestate.com/recipes/286239-binary-ordered-tree/
+# A binary ordered tree example
+
+class CNode:
+    left , right, data = None, None, 0
+    
+    def __init__(self, data):
+        # initializes the data members
+        self.left = None
+        self.right = None
+        self.data = data
+
+        
+class CBOrdTree:
+    def __init__(self):
+        # initializes the root member
+        self.root = None
+        
+    def addNode(self, data):
+        # creates a new node and returns it
+        return CNode(data)
+            
+    def insert(self, root, data):
+        # inserts a new data
+        if root == None:
+            # it there isn't any data
+            # adds it and returns
+            return self.addNode(data)
+        else:
+            # enters into the tree
+            if data <= root.data:
+                # if the data is less than the stored one
+                # goes into the left-sub-tree
+                root.left = self.insert(root.left, data)
+            else:
+                # processes the right-sub-tree
+                root.right = self.insert(root.right, data)
+                return root
+                    
+    def lookup(self, root, target):
+        # looks for a value into the tree
+        if root == None:
+            return 0
+        else:
+            # if it has found it...
+            if target == root.data:
+                return 1
+            else:
+                if target < root.data:
+                    # left side
+                    return self.lookup(root.left, target)
+                else:
+                    # right side
+                    return self.lookup(root.right, target)
+                        
+    def minValue(self, root):
+        # goes down into the left
+        # arm and returns the last value
+        while(root.left != None):
+            root = root.left
+            return root.data
+               
+    def maxDepth(self, root):
+        if root == None:
+            return 0
+        else:
+            # computes the two depths
+            ldepth = self.maxDepth(root.left)
+            rdepth = self.maxDepth(root.right)
+            # returns the appropriate depth
+            return max(ldepth, rdepth) + 1
+               
+    def size(self, root):
+        if root == None:
+            return 0
+        else:
+            return self.size(root.left) + 1 + self.size(root.right)
+            
+    def printTree(self, root):
+        # prints the tree path
+        if root == None:
+            pass
+        else:
+            self.printTree(root.left)
+            print root.data,
+            self.printTree(root.right)
+            
+    def printRevTree(self, root):
+        # prints the tree path in reverse
+        # order
+        if root == None:
+            pass
+        else:
+            self.printRevTree(root.right)
+            print root.data,
+            self.printRevTree(root.left)
+            
+if __name__ == "__main__":
+    # create the binary tree
+    BTree = CBOrdTree()
+    # add the root node
+    root = BTree.addNode(0)
+    # ask the user to insert values
+    for i in range(0, 5):
+        data = int(raw_input("insert the node value nr %d: " % i))
+        # insert values
+        BTree.insert(root, data)
+    print
+        
+    BTree.printTree(root)
+    print
+    BTree.printRevTree(root)
+    print
+    data = int(raw_input("insert a value to find: "))
+    if BTree.lookup(root, data):
+        print "found"
+    else:
+        print "not found"
+
+    print BTree.minValue(root)
+    print BTree.maxDepth(root)
+    print BTree.size(root)