Update app.py

app.py

@@ -9,20 +9,59 @@ def root():
 @app.get("/replacement")
 def get_code():
     return {
-        "text": """def factorial(n):
-    if n == 0:
-        return 1
-    else:
-        result = 1
-        for i in range(1, n + 1):
-            result *= i
-        return result
+        "text": """class TreeNode:
+    def __init__(self, value):
+        self.value = value
+        self.left = None
+        self.right = None
+
+class BinarySearchTree:
+    def __init__(self):
+        self.root = None
+
+    def insert(self, value):
+        def _insert(node, value):
+            if node is None:
+                return TreeNode(value)
+            if value < node.value:
+                node.left = _insert(node.left, value)
+            else:
+                node.right = _insert(node.right, value)
+            return node
+
+        self.root = _insert(self.root, value)
+
+    def inorder_traversal(self):
+        def _inorder(node):
+            if node:
+                _inorder(node.left)
+                print(node.value, end=' ')
+                _inorder(node.right)
+        _inorder(self.root)
+
+    def find(self, value):
+        def _find(node, value):
+            if node is None:
+                return False
+            if node.value == value:
+                return True
+            elif value < node.value:
+                return _find(node.left, value)
+            else:
+                return _find(node.right, value)
+        return _find(self.root, value)
 
 def main():
-    nums = [3, 5, 7]
-    for num in nums:
-        print(f"Factorial of {num} is {factorial(num)}")
+    bst = BinarySearchTree()
+    values = [50, 30, 70, 20, 40, 60, 80]
+    for v in values:
+        bst.insert(v)
+
+    print("Inorder traversal:")
+    bst.inorder_traversal()
+
+    print("\\nFind 40:", bst.find(40))
+    print("Find 100:", bst.find(100))
 
 main()"""
     }
-