Satellite

Ringkasan Tantangan

Rebuild binary trees from pre-order and in-order traversals.

Visit the satellite exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

Lihat Solusi Komunitas

The following are the top 3 community solutions by stars:

Solution 1 by @starsep (⭐ 0) — View on Exercism
Solution 2 by @thecjharries (⭐ 1) — View on Exercism
Solution 3 by @glennj (⭐ 1) — View on Exercism

Source: Exercism jq/satellite

💡 Lihat Solusi

def satellite:
  if .preorder == [] then {}
  else
    (.preorder | .[0]) as $root |
    (.inorder | index($root)) as $k |
    .inorder[:$k] as $inorderL |
    .inorder[$k+1:] as $inorderR |
    (.preorder | map(select(. as $x | $inorderL | contains([$x])))) as $preorderL |
    (.preorder | map(select(. as $x | $inorderR | contains([$x])))) as $preorderR |
    {