solved leetcode daily challenge, Binary Tree Pruning

Author: eval-exec

LeetCode/Binary_Tree_Pruning/main.cxx

@@ -0,0 +1,67 @@
+#include <bits/stdc++.h>
+#include <gtest/gtest.h>
+using namespace std;
+
+
+//// START
+/*
+## Binary Tree Pruning
+
+*/
+
+
+/**
+ * Definition for a binary tree node.
+ */
+struct TreeNode {
+  int val;
+  TreeNode *left;
+  TreeNode *right;
+  TreeNode() : val(0), left(nullptr), right(nullptr) {}
+  TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+  TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+};
+
+class Solution {
+ public:
+  TreeNode *pruneTree(TreeNode *root) {
+	if (!root) return nullptr;
+	if (!root->left && !root->right) {
+	  return root->val == 0 ? nullptr : root;
+	}
+	root->left = pruneTree(root->left);
+	root->right = pruneTree(root->right);
+	if (!root->left && !root->right && root->val == 0) return nullptr;
+	return root;
+  }
+};
+
+//// END
+struct T {
+
+};
+
+TEST(Solution, test) {
+  T ts[] = {
+	  {
+
+	  },
+	  {
+
+	  },
+
+  };
+
+  for (T t : ts) {
+	Solution solution;
+
+  }
+}
+
+int main() {
+  testing::InitGoogleTest();
+
+  return RUN_ALL_TESTS();
+}
+
+