added 3rd party packages, elog, bigtree

python310/packages/bigtree/binarytree/construct.py

@@ -0,0 +1,53 @@
+from typing import List, Type
+
+from bigtree.node.binarynode import BinaryNode
+
+__all__ = ["list_to_binarytree"]
+
+
+def list_to_binarytree(
+    heapq_list: List[int], node_type: Type[BinaryNode] = BinaryNode
+) -> BinaryNode:
+    """Construct tree from a list of numbers (int or float) in heapq format.
+
+    Examples:
+        >>> from bigtree import list_to_binarytree, tree_to_dot
+        >>> nums_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+        >>> root = list_to_binarytree(nums_list)
+        >>> root.show()
+        1
+        ├── 2
+        │   ├── 4
+        │   │   ├── 8
+        │   │   └── 9
+        │   └── 5
+        │       └── 10
+        └── 3
+            ├── 6
+            └── 7
+        >>> graph = tree_to_dot(root, node_colour="gold")
+        >>> graph.write_png("assets/construct_binarytree.png")
+
+        ![Sample Binary Tree](https://github.com/kayjan/bigtree/raw/master/assets/construct_binarytree.png)
+
+    Args:
+        heapq_list (List[int]): list containing integer node names, ordered in heapq fashion
+        node_type (Type[BinaryNode]): node type of tree to be created, defaults to ``BinaryNode``
+
+    Returns:
+        (BinaryNode)
+    """
+    if not len(heapq_list):
+        raise ValueError("Input list does not contain any data, check `heapq_list`")
+
+    root_node = node_type(heapq_list[0])
+    node_list = [root_node]
+    for idx, num in enumerate(heapq_list):
+        if idx:
+            if idx % 2:
+                parent_idx = int((idx - 1) / 2)
+            else:
+                parent_idx = int((idx - 2) / 2)
+            node = node_type(num, parent=node_list[parent_idx])  # type: ignore
+            node_list.append(node)
+    return root_node