Added graph visualisation, minor edits on 4.2

Author: StBogdan

.gitignore

@@ -0,0 +1,6 @@
+venv/
+graph_out/
+.vscode/
+settings.json
+
+*/__pycache__/*

__init__.py

@@ -1,49 +1,38 @@
 from typing import List
+from utils.graphs import BiNode
+from utils.treeviz import *
 # CTCI 4.2
 
+# Random links
+# https://orth.uk
+# https://foodprint.orth.uk  for software engineering project
+
+# https://devwebcl.blogspot.com/2016/12/big-o-comparison.html
+# https://awwapp.com/b/umyxkgethk506/
+
 
 def main():
     # ordered_list = [1, 2, 3, 6]
     ordered_list = [1, 2, 3, 6, 10, 12, 15, 16]
     print(ordered_list)
-    result = f"Result : {create_binary_from_sorted_arr(ordered_list)}"
+    result = create_binary_from_sorted_arr(ordered_list)
+    viz_tree(result)
     print(result)
 
 
-class Node:
-    val: int = None
-    left = None
-    right = None
-
-    def __str__(self):
-        return f"({self.left if self.left else '_' }/{self.val}\\{self.right if self.right else '_'})"
-
-    def __init__(self, val, left, right):
-        self.val = val
-        self.left = left
-        self.right = right
-
-        # https://orth.uk
-        # https://foodprint.orth.uk  for software engineering project
-
-
-def create_binary_from_sorted_arr(arr: List[int]) -> Node:
+def create_binary_from_sorted_arr(arr: List[int]) -> BiNode:
     if (len(arr) == 0):
         return None
     if (len(arr) == 1):
-        return Node(arr[0], None, None)
+        return BiNode(arr[0], None, None)
 
     # pick out middle number
     middle_index = len(arr) // 2
 
     # recursively call
     left = create_binary_from_sorted_arr(arr[0:middle_index])
     right = create_binary_from_sorted_arr(arr[middle_index + 1:])
-    return Node(arr[middle_index], left, right)
-
-    # https://devwebcl.blogspot.com/2016/12/big-o-comparison.html
-
-# https://awwapp.com/b/umyxkgethk506/
+    return BiNode(arr[middle_index], left, right)
 
 
 if __name__ == "__main__":

p4.2.py

@@ -0,0 +1,12 @@
+class BiNode:
+    val: int = None
+    left = None
+    right = None
+
+    def __str__(self):
+        return f"({self.left if self.left else '_' }/{self.val}\\{self.right if self.right else '_'})"
+
+    def __init__(self, val, left, right):
+        self.val = val
+        self.left = left
+        self.right = right

utils/__init__.py

@@ -0,0 +1,30 @@
+from graphviz import Digraph
+from utils.graphs import BiNode
+
+def viz_tree(root: BiNode):
+    graf = Digraph()
+
+    q = [root]
+
+    node_id, node_val = get_node_for_graph(root)
+    graf.node(node_id, node_val)
+
+    while q:
+        now_node = q.pop(0)
+        now_node_id, _ = get_node_for_graph(now_node)
+
+        for node in (now_node.left, now_node.right):
+            if node is not None:
+                node_id, node_val = get_node_for_graph(node)
+                graf.node(node_id, node_val)
+                graf.edge(now_node_id, node_id)
+                q.append(node)
+    
+    graf.render(filename='graph_out/result.dot')
+
+def get_node_for_graph(node):
+    node_id = str(id(node))
+    node_val = str(node.val)
+    return node_id, node_val
+
+