new version book with the first 2 chapters edited, examples added

src/builtin_structures/primes_generating.py

@@ -1,36 +0,0 @@
-#!/usr/bin/env python
-
-__author__ = "bt3"
-
-
-import math
-import random
-import sys
-from finding_prime import finding_prime_sqrt
-
-
-def generate_prime(number=3):
-    ''' return a n-bit prime '''
-    while 1:
-        p = random.randint(pow(2, number-2), pow(2, number-1)-1)
-        p = 2 * p + 1
-        if finding_prime_sqrt(p):
-            return p
-
-
-if __name__ == '__main__':
-    if len(sys.argv) < 2:
-        print ("Usage: generate_prime.py number")
-        sys.exit()
-    else:
-        number = int(sys.argv[1])
-        print(generate_prime(number))
-
-
-
-
-
-
-
-
-

src/trees/check_largest_item.py

@@ -0,0 +1,23 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+
+from binary_search_tree import BST, Node
+
+def largest(node):
+
+    if node.right:
+        return largest(node.right)
+    return node.item
+
+
+if __name__ == '__main__':
+
+
+    bst = BST()
+    l = [10, 5, 6, 3, 8, 2, 1, 11, 9, 4]
+    for i in l:
+        bst.add(i)
+
+    print(largest(bst.root))