p116

Author: ashwanikumar04

AllQuestions.md

@@ -1854,7 +1854,7 @@ same structure and node values with a subtree of s. A subtree of s is a tree
 consists of a node in s and all of this node's descendants. The tree s could
 also be considered as a subtree of itself.
 
-## Problem-116:waxing_crescent_moon:
+## [Problem-116](src/main/java/in/ashwanik/dcp/problems/p91_120/p116):sunny:
 
 
 > This problem was asked by Jane Street.

README.md

@@ -138,6 +138,12 @@ Solutions to the coding problems from [Daily coding problem](https://dailycoding
 |[P106](src/main/java/in/ashwanik/dcp/problems/p91_120/p106)|
 
 
+## **Jane Street (1)**
+| |
+|--|
+|[P116](src/main/java/in/ashwanik/dcp/problems/p91_120/p116)|
+
+
  # [Pending Questions](PendingQuestions.md):17
 | | | | | | | | | | | | | | | |
 |--|--|--|--|--|--|--|--|--|--|--|--|--|--|--|

src/main/java/in/ashwanik/dcp/problems/p91_120/p116/Readme.md

@@ -0,0 +1,4 @@
+
+Generate a finite, but an arbitrarily large binary tree quickly in O(1).
+
+That is, generate() should return a tree whose size is unbounded but finite.

src/main/java/in/ashwanik/dcp/problems/p91_120/p116/Solution.java

@@ -0,0 +1,27 @@
+package in.ashwanik.dcp.problems.p91_120.p116;
+
+import in.ashwanik.dcp.common.TreeNode;
+
+import java.util.Random;
+
+class Solution {
+
+    private Random random;
+
+    Solution() {
+        random = new Random();
+    }
+
+    TreeNode<Integer> generate() {
+        TreeNode<Integer> root = new TreeNode<>(0);
+        if (random.nextBoolean()) {
+            root.setLeft(generate());
+        }
+        if (random.nextBoolean()) {
+            root.setRight(generate());
+        }
+        return root;
+    }
+
+
+}

src/test/java/in/ashwanik/dcp/problems/p91_120/p116/SolutionTest.java

@@ -0,0 +1,12 @@
+package in.ashwanik.dcp.problems.p91_120.p116;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+
+public class SolutionTest {
+    @Test
+    void testGenerate() {
+        assertNotNull(new Solution().generate());
+    }
+}