Muhammad Usman ranasaani

## palindrome.py
def is_palindrome(num):
    rev = 0
    duplicate = num

    while duplicate > 0:
        r = duplicate % 10
        duplicate = int(duplicate / 10)
        rev = rev * 10 + r % 10
    return  num == rev

## find_duplicates_using_tree.py
import json

class Node:
   def __init__(self, val=0):
      self.right = ''
      self.left = ''
      self.value = val


class Tree(Node):
	def is_palindrome(num):
	rev = 0
	duplicate = num

	while duplicate > 0:
	r = duplicate % 10
	duplicate = int(duplicate / 10)
	rev = rev * 10 + r % 10
	return num == rev
	import json

	class Node:
	def __init__(self, val=0):
	self.right = ''
	self.left = ''
	self.value = val


	class Tree(Node):