Node.js) 백준 5639번: 이진 검색 트리

https://www.acmicpc.net/problem/5639

5639번: 이진 검색 트리

class Node{
  constructor(data,left,right){
    this.data = data;
    this.left = left;
    this.right = right;
  }
  show(){
    return this.data; 
  }
}


class BST{
  constructor(){
    this.root = null;
    this.preOrderList = '';
    this.inOrderList = '';
    this.postOrderList = '';
  }

  insert(data){ 
    let n = new Node(data,null,null);
    if(this.root == null){ 
      this.root = n; 
    }else{ 
      let current = this.root; 
      let parent; 
      while(true){ 
        parent = current; 
        if(data<current.data){
          current = current.left; 
          if(current==null){ 
            parent.left = n; 
            break; 
          }
        }else{
          current = current.right; 
          if(current == null){ 
            parent.right = n; 
            break; 
          }
        }
      }
    }
  }
}


const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n").map(Number);

const tree = new BST();

input.forEach(v=>{
  tree.insert(v);
})


let postOrderList = [];

function postOrder(node){ 
  if((node != null)){ 
    postOrder(node.left);
    postOrder(node.right);
    postOrderList.push(node.data);
  }
}

postOrder(tree.root);

console.log(postOrderList.join('\n'))