aboutsummaryrefslogtreecommitdiff
path: root/other/all_possible_full_tree.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/all_possible_full_tree.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/all_possible_full_tree.cpp')
-rw-r--r--other/all_possible_full_tree.cpp40
1 files changed, 40 insertions, 0 deletions
diff --git a/other/all_possible_full_tree.cpp b/other/all_possible_full_tree.cpp
new file mode 100644
index 0000000..ca54570
--- /dev/null
+++ b/other/all_possible_full_tree.cpp
@@ -0,0 +1,40 @@
+// 894. All Possible Full Binary Trees
+#include "leetcode.h"
+
+/*
+ * given an integer 'n', return a list of all possible full binary trees with
+ * 'n' nodes. each node of each tree in the answer must have 'node.val == 0'.
+ * each element of the answer is the root node of one possible tree. you may
+ * return the final list of trees in any order. a full binary tree is a binary
+ * tree where each node has exactly zero or two children
+ */
+
+class Solution {
+public:
+ vector<TreeNode *> allPossibleFBT(int n) {
+ unordered_map<int, vector<TreeNode *>> memo;
+ vector<TreeNode *> ans;
+ if (n < 1 || !n % 2)
+ return ans;
+ if (memo.find(n) != memo.end())
+ return memo[n];
+ if (n == 1) {
+ ans.push_back(new TreeNode(0));
+ memo[1] = ans;
+ return ans;
+ }
+ for (int i = 1; i < n; i += 2) {
+ vector<TreeNode *> left = allPossibleFBT(i);
+ vector<TreeNode *> right = allPossibleFBT(n - 1 - i);
+ for (int j = 0; j < left.size(); j++)
+ for (int k = 0; k < right.size(); k++) {
+ TreeNode *root = new TreeNode(0);
+ root->left = left[j];
+ root->right = right[k];
+ ans.push_back(root);
+ }
+ }
+ memo[n] = ans;
+ return ans;
+ }
+};