class Solution:
    def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:


        def helper(qu):
            if not qu:
                return 

            i = len(qu)
            temp = []
            nextsize = 0
       
            
            while i > 0 :
                poped = qu.popleft()
                temp.append(poped.val)

                if poped.left:
                    qu.append(poped.left)
                    nextsize += 1

                if poped.right:
                    qu.append(poped.right)
                    nextsize += 1
                          

                i -= 1

            ans.append(temp)
            helper(qu)

        if not root:
            return []

        ans =[]
        q = deque()
        q.append(root)
        helper(q)

        return ans

class Solution:
    def averageOfLevels(self, root: Optional[TreeNode]) -> List[float]:

        def helper(qu):
            if not qu:
                return

            i = len(qu)
            leng = len(qu)
            total = 0

            while i > 0:
                poped = qu.popleft()
                total += poped.val

                if poped.left:
                    qu.append(poped.left)
                if poped.right:
                    qu.append(poped.right)            

                i -= 1
            ans.append(total/leng)
            helper(qu)
        qu = deque()
        qu.append(root)
        ans = []

        helper(qu)

        return ans

class Solution:
    def countOperations(self, num1: int, num2: int) -> int:
        count = 0
        while num1 and num2:
            if num1>=num2:
                count +=  num1//num2
                num1 =  num1%num2
            else:
                count +=  num2//num1
                num2 =  num2%num1
        return count