コード例 #1
0
ファイル: SymbolTable.py プロジェクト: AleeArdelian/LFTC
class SymbolTable:
    def __init__(self):
        self._binaryTree = Tree()

    def add(self, value):
        return self._binaryTree.Insert(value)

    def get(self, value):
        return self._binaryTree.find(value)

    def PrintSymbolTable(self):
        print(self._binaryTree)
コード例 #2
0
from BinaryTree import Tree
from BinaryTree import Node
import math
from Helper import helper
import random

print('-----Test generate a Tree-----')
tree = Tree()
data = [1, 2, 3, 4, 5, 6, 7, 8, 9]
tree.createFromList(data)
tree.printTree()

print('-----Test find a node-----')
node = tree.getListNodes()[7]
print('Node: ', node)
nodeFound = tree.find(node)
print('Parent node found: ', nodeFound)
nodeFound = tree.find(Node(6))
print('Parent node found: ', nodeFound)

print('----c-Test eval()-----')
x = 8
print(eval('((8)*(x))'))
print(eval('((9)*(math.sin((7)*(x))))'))
print(eval('(((8)*(x))+((0)*(x)*(1)*(x)))'))

print('-----Test number of Nodes-----')
print('Deph 1:', helper.calculateNumberOfNodes(1))
print('Deph 2:', helper.calculateNumberOfNodes(2))
print('Deph 3:', helper.calculateNumberOfNodes(3))
print('Deph 4:', helper.calculateNumberOfNodes(4))