Merge pull request #74 from Arnavthakare19/main

Added palindrome folder

B/Random Binary Tree Generator/treegenerator.py

@@ -0,0 +1,40 @@
+import random 
+
+
+class Node: 
+    def __init__(self, value): 
+        self.value = value 
+        self.left = None
+        self.right = None
+
+def generate_random_binary_tree(size): 
+    if size == 0: 
+        return None
+
+    # Choose random sizes for left and right subtrees 
+    left_size = random.randint(0, size-1) 
+    right_size = size - 1 - left_size 
+
+    # Generate left and right subtrees recursively 
+    left_subtree = generate_random_binary_tree(left_size) 
+    right_subtree = generate_random_binary_tree(right_size) 
+
+    # Create new node with random value 
+    root = Node(random.randint(0, 100)) 
+
+    # Assign left and right subtrees to children 
+    root.left = left_subtree 
+    root.right = right_subtree 
+
+    return root 
+
+
+def print_tree(node, level=0): 
+    if node is not None: 
+        print_tree(node.right, level + 1) 
+        print(" " * 4 * level + "->", node.value) 
+        print_tree(node.left, level + 1) 
+
+
+tree = generate_random_binary_tree(input('Enter the size of binary tree')) 
+print_tree(tree) 

P/Palindrome/palindrome_number.py

@@ -0,0 +1,11 @@
+num=int(input("Enter a number:"))
+temp=num
+rev=0
+while(num>0):
+    dig=num%10
+    rev=rev*10+dig
+    num=num//10
+if(temp==rev):
+    print("The number is palindrome!")
+else:
+    print("Not a palindrome!")

P/Palindrome/palindrome_string.py

@@ -0,0 +1,16 @@
+def isPalindrome(str):
+
+
+    for i in range(0, int(len(str)/2)):
+        if str[i] != str[len(str)-i-1]:
+            return False
+    return True
+
+
+s = "malayalam"
+ans = isPalindrome(s)
+
+if (ans):
+    print("Yes")
+else:
+    print("No")