Coding
Algorithms

Depth of an n-ary Tree Without Recursion

Premium
Difficulty

Read the problem, hints and solution here. The editor needs a bigger screen: open this page on a laptop to write and run your code.

xx xxxxxxxxxxx xxxxxxxxxxxx xxxxxxxxx xxxxxxxxx xxxxx xxxx xxx xx xxx xxxx "xxx xx xxx xxxx xxx xxx xxxxx xx xx x-xxx xxxx xxxx xx xxxxxxxxx". xxx xxxx xx xxxx; xxx xxxxxxxxxxx xx xxx xxxxxxxx.

x xxxx xx (x) xxxxx xx xxxxx xx x xxxxxx xxxxx: xxxxxx[x] xx xxx xxxxx xx xxxx x'x xxxxxx, xxx xxxxxxx xxx xxxx xxx xxxxxx[x] == -x, xxx xxxx. x xxxx xxx xxxx xxx xxxxxx xx xxxxxxxx, xxx x xxxxx'x xxxxx xxx xx xxxxxxx xxxx xxx xxxxxx'x.

xxxxxxxxx xxxx_xxxxx(xxxxxx) xxxxxxxxx xxx xxxxx xx xxx xxxx: xxx xxxxxx xx xxxxx xx xxx xxxxxxx xxxx xxxx xxx xxxx xx x xxxx. x xxxxxx xxxx xx x xxxx xx xxxxx x. xx xxxxx xxxx xx xxxxx x.

xx xxx xxxxxxx. xxx xxxxxxx xxxxxx xxxx xx x xxxxx xx (x xxxxx xx^x) xxxxx, xxx x xxxxxxxxx xxxxx-xxxxx xxxxxx xxxx xxxxxx'x xxxxxxx xxxxxxxxx xxxxx xx xx xxx xxxxx xxxx x xxxxxxx xxxxx. xxxx xx xxx xxxxx xx xxx xxxxxxxx.

xxxxxxxx

xxxx_xxxxx([-x, x, x, x, x, x])
# x  (xxxx x, xxxxxxxx x xxx x, xxxx x, x xxxxx x xxx x xxxxx x)

xxxx_xxxxx([x, x, -x])
# x  (x xxxxx x -> x -> x; xxx xxxx xx xxx xxxx xxxxx)

xxxxxxxxxxx

  • x <= xxx(xxxxxx) <= xxxxxx; xxx xxxxx xx xxxxxx x xxxxxx xxxxx xxxx.
  • xxxxxx[x] xx -x xxx xxxxxxx xxx xxxx xxxx xxx xxxx xx xxx-xxxxx, xxx xxxxxxxxx x xxxxx xxxxx xxxx xx xxx x.
  • xxxxxxxx xxx xxxxxx xxxxxx xxxxx xxxxxx xx xxxxx xxxxx, xx x xxxxxx xxxx xxxx xxxxx xxxxx[xxxxxx[x]] xxxxxx xx xxx xxxx xxxxxxxx xxxxx xxx xxxxx xxxxxx xx xxxx xxxxxx xxxxx.
  • xxx xxx (x(x)). xx xxxxxxxxx, xxxxxxxx xx xxxxxxx x xxxxxx.

This problem is only available to subscribers.

Language: Python 3.12tree_depth

Unlock the problem to run it against the tests.