vbrazo · October 1, 2019 22:56 · Oct 1, 2019
diff --git a/zigzap.py b/zigzap.py
@@ -0,0 +1,41 @@
+# =begin
+# # Given a Balanced Binary Tree (BBT)
+# # (non-sorted, non-search, containing unique elements)
+
+#                    42
+#                   /  \
+#                  /    \
+#                 /      \
+#                /        \
+#               81        99
+#              /  \      /  \
+#            17    1    25   19
+#            / \   / \  / \ / \
+#           8 -1  2  9 5  6 3  31
+
+# and its array representation:
+# [42, 81, 99, 17, 1, 25, 19, 8, -1, 2, 9, 5, 6, 3, 31]
+
+
+# Write a function that will take any BBT array of integers
+# (structured in the manner above), and an integer in that array,
+# and return a list of "zigzag" directions to get to that destination,
+# starting from the root.
+
+# To go left, adds "zig"
+# To go right, adds "zag"
+
+# Example:
+
+# tree = [42, 81, 99, 17, 1, 25, 19, 8, -1, 2, 9, 5, 6, 3, 31]
+
+# zigzag_directions(tree, 42) -> []
+# zigzag_directions(tree, 31) -> ['zag', 'zag', 'zag']
+# zigzag_directions(tree, -1) -> ['zig', 'zig', 'zag']
+# zigzag_directions(tree, 100) -> None
+
+
+# zigzag_directions(tree, 1) -> ['zig', 'zag']
+# zigzag_directions(tree, 6) -> ['zag', 'zig', 'zag']
+
+# =end