Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.
Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.
Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.
Update your browser to view this website correctly. Update my browser now