DevMahmoud10

class Solution:
    def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
        if not root:return []
        res=[]
        q=[(root,0)]
        while len(q)>0:
            node,level=q.pop(0)
            if len(res)<level+1:
                res.append([])
            res[level].append(node.val)

DevMahmoud10

# Byte-compiled / optimized / DLL files
__pycache__/
*.py[cod]
*$py.class

# C extensions
*.so

# Distribution / packaging

DevMahmoud10

Loss at epoch 0 =  tensor(0.6932, grad_fn=<NllLossBackward>)
Loss at epoch 1000 =  tensor(0.5234, grad_fn=<NllLossBackward>)
Loss at epoch 2000 =  tensor(0.5206, grad_fn=<NllLossBackward>)
Loss at epoch 3000 =  tensor(0.3477, grad_fn=<NllLossBackward>)
Loss at epoch 4000 =  tensor(0.3470, grad_fn=<NllLossBackward>)
Loss at epoch 5000 =  tensor(0.3468, grad_fn=<NllLossBackward>)
Loss at epoch 6000 =  tensor(0.3467, grad_fn=<NllLossBackward>)
Loss at epoch 7000 =  tensor(0.3466, grad_fn=<NllLossBackward>)
Loss at epoch 8000 =  tensor(0.3466, grad_fn=<NllLossBackward>)
Loss at epoch 9000 =  tensor(0.3466, grad_fn=<NllLossBackward>)