HM 2
HM 2
self.left = None
self.right = None
self.val = key
if root is None:
return 0
else:
q2
class BinarySearchTree:
def __init__(self):
self.root = None
class Node:
self.left = None
self.right = None
self.val = key
def insert(self, key):
if self.root is None:
self.root = self.Node(key)
else:
self._insert(self.root, key)
if node.left is None:
node.left = self.Node(key)
else:
self._insert(node.left, key)
else:
if node.right is None:
node.right = self.Node(key)
else:
self._insert(node.right, key)
return node
if key < node.val:
q3
def evaluate_postfix(expression):
stack = []
if token.isdigit():
stack.append(int(token))
else:
b = stack.pop()
a = stack.pop()
if token == '+':
stack.append(a + b)
stack.append(a - b)
stack.append(a * b)
stack.append(a / b)
return stack.pop()
# مثال لالستخدام