Created
April 4, 2019 19:39
-
-
Save ranasaani/e8603322527b3e97eef8b85f3de58b41 to your computer and use it in GitHub Desktop.
Find Duplicates Using Binary Tree
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import json | |
class Node: | |
def __init__(self, val=0): | |
self.right = '' | |
self.left = '' | |
self.value = val | |
class Tree(Node): | |
def addNode(self, tree, node, duplicates): | |
if not tree: | |
tree = node | |
elif tree.value > node.value: | |
if tree.left: | |
tree.left = self.addNode(tree.left, node, duplicates) | |
else: | |
tree.left = node | |
elif tree.value < node.value: | |
if tree.right: | |
tree.right = self.addNode(tree.right, node, duplicates) | |
else: | |
tree.right = node | |
elif tree.value == node.value: | |
duplicates.append(node.value) | |
return tree | |
def buildTree(): | |
arr = [14, 15, 4, 9, 7, 18, 3, 5, 16, 20,4,17, 9, 14, 5] | |
tree = Tree() | |
duplicates = [] | |
for v in arr: | |
node = Node(v) | |
tree = tree.addNode(tree, node, duplicates) | |
s = json.dumps(tree.__dict__, default=serialize) | |
print(s) | |
print(duplicates) | |
def serialize(obj): | |
return obj.__dict__ | |
if __name__ == '__main__': | |
buildTree() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment