` ````
```

Loading Question ...

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.

The adding rule is: given a positive integer depth `d`

, for each NOT null tree nodes `N`

in depth `d-1`

, create two tree nodes with value `v`

as `N's`

left subtree root and right subtree root. And `N's`

**original left subtree** should be the left subtree of the new left subtree root, its **original right subtree** should be the right subtree of the new right subtree root. If depth `d`

is 1 that means there is no depth d-1 at all, then create a tree node with value **v** as the new root of the whole original tree, and the original tree is the new root's left subtree.

**Example 1:**

Input:A binary tree as following: 4 / \ 2 6 / \ / 3 1 5v = 1d = 2Output:4 / \ 1 1 / \ 2 6 / \ / 3 1 5

**Example 2:**

Input:A binary tree as following: 4 / 2 / \ 3 1v = 1d = 3Output:4 / 2 / \ 1 1 / \ 3 1

**Note:**

- The given d is in range [1, maximum depth of the given tree + 1].
- The given binary tree has at least one tree node.

Seen this question in a real interview before?

Yes

No

When did you encounter this question?

last week

last month

last 3 month

last 6 month

more than 6 months

other

Which stage?

Online Assessment

Phone Interview

Onsite Interview

Don't know

Which company?

Adobe

Aetion

Airbnb

Alibaba

Amazon

Apple

Baidu

Bloomberg

Cloudera

Coursera

Cryptic Studios

Dropbox

eBay

Epic Systems

Expedia

Facebook

Fallible

Games

Gilt Groupe

GoDaddy

Goo

Google

Hedvig

Helix

Houzz

Hulu

Indeed

Intuit

IXL

LinkedIn

LiveRamp

Lyft

MAQ Software

Mathworks

Microsoft

NetEase

Netsuite

Palantir

Palantir Technologies

Pinterest

Pocket Gems

Poynt

Pure

Pure Storage

Rackspace

Riot

Riot Games

Samsung

Snapchat

Square

Storage

Tencent

TinyCo

Twitter

Two Sigma

Uber

Valve

WAP

Works Applications

Yahoo

Yahoo!

Yelp

Zappos

Zenefits

How can we help you?