<div id="readability-page-1" class="page"><article id="mainContent">
                                <div>
                                    <p><a href="/m/category/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98"><span>알고리즘</span></a></p><h3>[백준 / javascript] 1991번 트리 순회</h3>
                                </div>
                                <p><cite>Suhyeon Lee</cite>
                                    <span> 2023. 4. 10. 15:27</span>
                                </p>
                                

<ins data-ad-client="ca-pub-9527582522912841" data-ad-slot="8674651030" data-ad-format="auto" data-full-width-responsive="true" data-ad-type="inventory"></ins>



                            <div>
                                <p data-ke-size="size16"><a href="https://www.acmicpc.net/problem/1874">https://www.acmicpc.net/problem/1874</a></p>
<pre><code>// 1991 : 트리 순회

const readFile = process.platform === 'linux' ? '/dev/stdin' : 't.txt';

const [n, ...input] = require('fs')
  .readFileSync(readFile)
  .toString()
  .trim()
  .split('\\n');

const nodes = input.map((v) =&gt; v.split(' '));
const trees = nodes.reduce((acc, [node, left, right]) =&gt; {
  acc[node] = { left, right };
  return acc;
}, {});

const traversePreOrder = (node) =&gt; {
  if (node === '.') {
    return '';
  }
  const { left, right } = trees[node];
  return node + traversePreOrder(left) + traversePreOrder(right);
};

const traverseInOrder = (node) =&gt; {
  if (node === '.') {
    return '';
  }
  const { left, right } = trees[node];
  return traverseInOrder(left) + node + traverseInOrder(right);
};

const traversePostOrder = (node) =&gt; {
  if (node === '.') {
    return '';
  }
  const { left, right } = trees[node];
  return traversePostOrder(left) + traversePostOrder(right) + node;
};

console.log(traversePreOrder('A'));
console.log(traverseInOrder('A'));
console.log(traversePostOrder('A'));
</code></pre>
            
            
                </div>
            
                                            
            
                            </article></div>

공부 기록하는 블로그

Suhyeon Lee

https://www.acmicpc.net/problem/1874
// 1991 : 트리 순회
const readFile = process.platform === 'linux' ? '/dev/stdin' : 't.txt';
const [n, ...input] = require('fs')
  .readFileSync(readFile)
  .toString()
  .trim()
  .split('\\n');
const nodes = input.map((v) => v.split(' '));
const trees = nodes.reduce((acc, [node, left, right]) => {
  acc[node] = { left, right };
  return acc;
}, {});
const traversePreOrder = (node) => {
  if (node === '.') {
    return '';
  }
  const { left, right } = trees[node];
  return node + traversePreOrder(left) + traversePreOrder(right);
};
const traverseInOrder = (node) => {
  if (node === '.') {
    return '';
  }
  const { left, right } = trees[node];
  return traverseInOrder(left) + node + traverseInOrder(right);
};
const traversePostOrder = (node) => {
  if (node === '.') {
    return '';
  }
  const { left, right } = trees[node];
  return traversePostOrder(left) + traversePostOrder(right) + node;
};
console.log(traversePreOrder('A'));
console.log(traverseInOrder('A'));
console.log(traversePostOrder('A'));

[백준 / javascript] 1991번 트리 순회

댓글