Added java code

Author: AdyHACK

src/main/java/com/thealgorithms/datastructures/BinaryTreeRightSideView.java

@@ -5,61 +5,66 @@
 import java.util.List;
 import java.util.Queue;
 
+
 public class BinaryTreeRightSideView {
 
-    // FIX: Make the TreeNode class static.
-    static class TreeNode {
+
+    public static class TreeNode {
         int val;
-        TreeNode left, right;
-        TreeNode(int x) {
-            this.val = x;
+        TreeNode left;
+        TreeNode right;
+
+        TreeNode(int val) {
+            this.val = val;
         }
     }
 
-    // FIX: Make the RightSideView class static.
-    public static class RightSideView {
-        public List<Integer> rightSideView(TreeNode root) {
-            List<Integer> result = new ArrayList<>();
-            if (root == null) {
-                return result;
-            }
+    public List<Integer> rightSideView(TreeNode root) {
+        List<Integer> result = new ArrayList<>();
+        if (root == null) {
+            return result;
+        }
+
+        Queue<TreeNode> queue = new LinkedList<>();
+        queue.add(root);
+
+        while (!queue.isEmpty()) {
+           
+            int levelSize = queue.size();
 
-            Queue<TreeNode> queue = new LinkedList<>();
-            queue.add(root);
-
-            while (!queue.isEmpty()) {
-                int size = queue.size();
-                for (int i = 0; i < size; i++) {
-                    TreeNode node = queue.poll();
-
-                    // If it's the last node in this level, add it to the result.
-                    if (i == size - 1) {
-                        result.add(node.val);
-                    }
-
-                    if (node.left != null) {
-                        queue.add(node.left);
-                    }
-                    if (node.right != null) {
-                        queue.add(node.right);
-                    }
+            for (int i = 0; i < levelSize; i++) {
+                TreeNode currentNode = queue.poll();
+
+             
+                if (i == levelSize - 1) {
+                    result.add(currentNode.val);
+                }
+
+               
+                if (currentNode.left != null) {
+                    queue.add(currentNode.left);
+                }
+                if (currentNode.right != null) {
+                    queue.add(currentNode.right);
                 }
             }
-            return result;
         }
+        return result;
+    }
 
-        // The main method can now correctly instantiate these static classes.
-        public static void main(String[] args) {
-            RightSideView sol = new RightSideView();
+    
+    public static void main(String[] args) {
+       
+        BinaryTreeRightSideView solution = new BinaryTreeRightSideView();
 
-            TreeNode root = new TreeNode(1);
-            root.left = new TreeNode(2);
-            root.right = new TreeNode(3);
-            root.left.right = new TreeNode(5);
-            root.right.right = new TreeNode(4);
+        TreeNode root = new TreeNode(1);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(3);
+        root.left.right = new TreeNode(5);
+        root.right.right = new TreeNode(4);
 
-            // The logic correctly produces the right side view.
-            System.out.println(sol.rightSideView(root)); // Expected Output: [1, 3, 4]
-        }
+        List<Integer> view = solution.rightSideView(root);
+
+        System.out.println("Right Side View: " + view); 
     }
 }