add more tree tasks

src/cw8/count_symmetrical_nodes.c

@@ -3,8 +3,7 @@ policz węzły drzewa które mają tyle samo kroków do korzenia
 co do najgłębszego liścia
 */
 
-
-#include <stdlib.h>
+#define MIN(x, y) (((x) < (y)) ? (x) : (y))
 
 typedef struct bin_tree bin_tree;
 

src/cw8/zad10/is_ultraleftist.c

@@ -0,0 +1,23 @@
+#include <stdbool.h>
+
+typedef struct node* bin_tree;
+
+struct node {
+    int val;
+    bin_tree left, right;
+};
+
+bool is_ultraleftist(bin_tree t, int depth, int* depth_last) {
+    if (!t) return true;
+
+    if (!t->left && !t->right) {
+        if (*depth_last < depth)
+            return false;
+
+        *depth_last = depth;
+        return true;
+    }
+
+    return is_ultraleftist(t->left, depth + 1, depth_last) 
+        && is_ultraleftist(t->right, depth + 1, depth_last);
+}

src/cw8/zad12/cut_tree_into_two.c

@@ -0,0 +1,10 @@
+typedef struct node* bin_tree;
+
+struct node {
+    int val;
+    bin_tree left, right;
+};
+
+// policz rozmiar drzewa: int size
+
+// przejdź przez drzewo postorderem

src/cw8/zad8/jump_traversal.c

@@ -1,5 +1,3 @@
-#include <stdlib.h>
-
 typedef struct bin_tree bin_tree;
 
 struct bin_tree {