Add problems which needs to be implemented

Author: pulkit-gupta-ggn

src/main/java/com/pulkit/datastructures_algorithms/todo/BSTSequnces.java

@@ -0,0 +1,10 @@
+package com.pulkit.datastructures_algorithms.todo;
+
+/*
+ A binary search tree was created by traversing through an array from
+ left to right and inserting each element. Given a binary search tree
+ with distinct elements,print all possible arrays that could have led to this tree
+*/
+
+public class BSTSequnces {
+}

src/main/java/com/pulkit/datastructures_algorithms/todo/FindInorderSuccessorWithParentPointer.java

@@ -0,0 +1,11 @@
+package com.pulkit.datastructures_algorithms.todo;
+
+/*
+Write an algorithm to find the "next" node (i.e., in-order successor)
+of a given node in a binary search tree.
+You may assume that each node has a link to its parent.
+*/
+
+public class FindInorderSuccessorWithParentPointer {
+
+}

src/main/java/com/pulkit/datastructures_algorithms/todo/getRandomNodeFromBinaryTree.java

@@ -0,0 +1,11 @@
+package com.pulkit.datastructures_algorithms.todo;
+
+/*
+You are implementing a binary tree class from scratch which, in addition to insert,
+find, and delete, has a method getRandomNode() which returns a random node from the tree.
+All nodes should be equally likely to be chosen. Design and implement an algorithm for
+getRandomNode, and explain how you would implement the rest of the methods.
+ */
+
+public class getRandomNodeFromBinaryTree {
+}