Added binary tree code.

jslvtr · jslvtr · commit 83c9cddabfce · 2018-03-25T21:02:08.000+01:00
diff --git a/section17/projects/binary_tree/app.py b/section17/projects/binary_tree/app.py
@@ -1,17 +1,12 @@
-from btree import BinaryTree
+from binary_tree import BinaryTree
 from node import Node
 
-tree = BinaryTree(Node('Paco', 6))
+tree = BinaryTree(Node(6))
 
-nodes = [
-    ('Jose', 5),
-    ('Rolf', 3),
-    ('Anne', 7),
-    ('Charlie', 11),
-    ('Jen', 2)
-]
+nodes = [5, 3, 9, 7, 8, 7.5, 12, 11]
 
 for n in nodes:
-    tree.add(Node(*n))
+    tree.add(Node(n))
 
-tree.flatten()
+tree.delete(9)
+tree.inorder()
diff --git a/section17/projects/binary_tree/btree.py b/section17/projects/binary_tree/btree.py
diff --git a/section17/projects/binary_tree/node.py b/section17/projects/binary_tree/node.py
@@ -1,9 +1,8 @@
 class Node:
-    def __init__(self, name, value, left=None, right=None):
-        self.name = name
+    def __init__(self, value, left=None, right=None):
         self.value = value
         self.left = left
         self.right = right
 
     def __repr__(self):
-        return f'<Node {self.name}, {self.value}>'
+        return f'<Node {self.value}>'
