Create RecursiveFibo.java

CPP/binarytree.cpp

@@ -0,0 +1,65 @@
+// Binary Tree in C++
+
+#include <stdlib.h>
+
+#include <iostream>
+
+using namespace std;
+
+struct node {
+ int data;
+ struct node *left;
+ struct node *right;
+};
+
+// New node creation
+struct node *newNode(int data) {
+ struct node *node = (struct node *)malloc(sizeof(struct node));
+
+ node->data = data;
+
+ node->left = NULL;
+ node->right = NULL;
+ return (node);
+}
+
+// Traverse Preorder
+void traversePreOrder(struct node *temp) {
+ if (temp != NULL) {
+ cout << " " << temp->data;
+ traversePreOrder(temp->left);
+ traversePreOrder(temp->right);
+ }
+}
+
+// Traverse Inorder
+void traverseInOrder(struct node *temp) {
+ if (temp != NULL) {
+ traverseInOrder(temp->left);
+ cout << " " << temp->data;
+ traverseInOrder(temp->right);
+ }
+}
+
+// Traverse Postorder
+void traversePostOrder(struct node *temp) {
+ if (temp != NULL) {
+ traversePostOrder(temp->left);
+ traversePostOrder(temp->right);
+ cout << " " << temp->data;
+ }
+}
+
+int main() {
+ struct node *root = newNode(1);
+ root->left = newNode(2);
+ root->right = newNode(3);
+ root->left->left = newNode(4);
+
+ cout << "preorder traversal: ";
+ traversePreOrder(root);
+ cout << "\nInorder traversal: ";
+ traverseInOrder(root);
+ cout << "\nPostorder traversal: ";
+ traversePostOrder(root);
+}

Java/Factorial.java

@@ -0,0 +1,10 @@
+class FactorialExample{ 
+ public static void main(String args[]){ 
+ int i,fact=1; 
+ int number=5;//It is the number to calculate factorial 
+ for(i=1;i<=number;i++){ 
+ fact=fact*i; 
+ } 
+ System.out.println("Factorial of "+number+" is: "+fact); 
+ } 
+} 

Java/RecursiveFibo.java

@@ -0,0 +1,28 @@
+import java.util.*;
+public class fibonacci{
+ public static int fib(int n){
+ if(n==1){
+ return array[0];
+ }
+ // base cases
+ if(n==2){
+ return array[1];
+ }
+ else{
+ array[n-1] = fib(n-1) + fib(n-2);
+ return (array [n-1]);
+ }
+ }
+ public static void main(String args[]){
+ int n;
+ Scanner snr= new Scanner(System.in);
+ n=snr.nextInt();
+ snr.close();
+ array[0]=0;
+ array[1]=1;
+ System.out.println(fib(n));
+ // printing number in fibonacci series
+ }
+ static int array[]=new int[1000];
+ // Declaring global array large enough
+ }