623. Add One Row to Tree
![[LeetCode] 623. Add One Row to Tree](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FI01b5%2FbtrNUGeJZOt%2FAAAAAAAAAAAAAAAAAAAAAHppe_sFOzU8o0dfH_yd8P5lKFF9VnDTzsiRkAWvh1xa%2Fimg.jpg%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3D61%252BymtwYiefEg3wjAacmwHkaz2w%253D)
[LeetCode] 623. Add One Row to Tree
623. Add One Row to Tree Medium Given the root of a binary tree and two integers val and depth, add a row of nodes with value val at the given depth depth. Note that the root node is at depth 1. The adding rule is: Given the integer depth, for each not null tree node cur at the depth depth - 1, create two tree nodes with value val as cur's left subtree root and right subtree root. cur's original..