Added codes for 6 May

GeeksForGeeks/May/06-5-24/GFG.java

@@ -0,0 +1,151 @@
+//{ Driver Code Starts
+import java.util.LinkedList; 
+import java.util.Queue; 
+import java.io.*;
+import java.util.*;
+
+class Node{
+    int data;
+    Node left;
+    Node right;
+    Node(int data){
+        this.data = data;
+        left=null;
+        right=null;
+    }
+}
+
+class GfG {
+
+    static Node buildTree(String str){
+
+        if(str.length()==0 || str.charAt(0)=='N'){
+            return null;
+        }
+
+        String ip[] = str.split(" ");
+        // Create the root of the tree
+        Node root = new Node(Integer.parseInt(ip[0]));
+        // Push the root to the queue
+
+        Queue<Node> queue = new LinkedList<>(); 
+
+        queue.add(root);
+        // Starting from the second element
+
+        int i = 1;
+        while(queue.size()>0 && i < ip.length) {
+
+            // Get and remove the front of the queue
+            Node currNode = queue.peek();
+            queue.remove();
+
+            // Get the current node's value from the string
+            String currVal = ip[i];
+
+            // If the left child is not null
+            if(!currVal.equals("N")) {
+
+                // Create the left child for the current node
+                currNode.left = new Node(Integer.parseInt(currVal));
+                // Push it to the queue
+                queue.add(currNode.left);
+            }
+
+            // For the right child
+            i++;
+            if(i >= ip.length)
+                break;
+
+            currVal = ip[i];
+
+            // If the right child is not null
+            if(!currVal.equals("N")) {
+
+                // Create the right child for the current node
+                currNode.right = new Node(Integer.parseInt(currVal));
+
+                // Push it to the queue
+                queue.add(currNode.right);
+            }
+            i++;
+        }
+
+        return root;
+    }
+    static void printInorder(Node root)
+    {
+        if(root == null)
+            return;
+
+        printInorder(root.left);
+        System.out.print(root.data+" ");
+
+        printInorder(root.right);
+    }
+
+    public static void main (String[] args) throws IOException{
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int t=Integer.parseInt(br.readLine());
+
+        while(t-- > 0){
+            String s = br.readLine();
+            Node root = buildTree(s);
+            Tree g = new Tree();
+            ArrayList<Integer> ans = g.noSibling(root);
+
+            for (Integer val: ans) 
+                System.out.print(val+" "); 
+            System.out.println();
+        }
+    }
+}
+// } Driver Code Ends
+
+
+//User function Template for Java
+
+/*  A Binary Tree nodea
+class Node
+{
+    int data;
+    Node left, right;
+
+    Node(int item)
+    {
+        data = item;
+        left = right = null;
+    }
+}
+*/
+class Tree
+{
+    ArrayList<Integer> noSibling(Node node)
+    {
+        // code here
+        ArrayList<Integer> ans = new ArrayList<>();
+        helper(node, ans);
+        Collections.sort(ans);
+
+        if(ans.size()==0)
+            ans.add(-1);
+
+        return ans;
+    }
+
+    private void helper(Node root, ArrayList<Integer> ans)
+    {
+        if(root==null)
+            return;
+        if(root.left==null && root.right==null)
+            return;
+
+        if(root.left==null)
+            ans.add(root.right.data);
+        else if(root.right==null)
+            ans.add(root.left.data);
+
+        helper(root.left, ans);
+        helper(root.right, ans);
+    }
+}

GeeksForGeeks/May/06-5-24/README.md

@@ -0,0 +1,2 @@
+Time complexity - O(n * logn)
+Space complexity - O(h)

LeetCode/May/06-5-24/README.md

@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(1)

LeetCode/May/06-5-24/Solution.java

@@ -0,0 +1,46 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution 
+{
+    public ListNode removeNodes(ListNode head) 
+    {
+        ListNode reverse = null;
+        while(head != null)
+        {
+            ListNode temp = head.next;
+            head.next = reverse;
+            reverse = head;
+            head = temp;
+        }
+
+        ListNode remove = null;
+        int max = reverse.val;
+        remove = reverse;
+        reverse = reverse.next;
+        remove.next = null;
+
+        while(reverse != null)
+        {
+            if(max <= reverse.val)
+            {
+                max = reverse.val;
+                ListNode temp = reverse.next;
+                reverse.next = remove;
+                remove = reverse;
+                reverse = temp;
+            }
+            else
+                reverse = reverse.next;
+        }
+
+        return remove;
+    }
+}