Print Binary Tree

Description

Given the root of a binary tree of height h, lay it out in an (h+1) x (2^(h+1) - 1) string matrix. Place the root at the midpoint of the top row; recursively place each node's left child offset left and right child offset right by half the remaining column span. Fill all empty cells with "". Return the resulting matrix.

Code

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def printTree(self, root: Optional[TreeNode]) -> List[List[str]]: