关于#python#的问题：用递归函数把值都存在栈内

class Stack:
    def __init__(self):
        self.items = []

    def isEmpty(self):
        return self.items == []

    def push(self, item):
        self.items.append(item)

    def pop(self):
        return self.items.pop()

    def peek(self):
        return self.items[len(self.items) - 1]

    def size(self):
        return len(self.items)

def tostr(n, base):
    string = "0123456789ABCDEF"
    s = Stack()
    binstr = ""
    if n < base:
        return string[n]
    else:
        return tostr(n // base, base) + string[n % base]

print(tostr(n=10, base=2))