Portfolio


const Tree = [
    undefined,
             1,
           2, 3,
         4,5, 6,7,
 8,9, 10,11, 12,13, 14,15
]

function preorder(tree, i) {
    if(tree[i] === undefined) {
        return;
    }
    console.log(tree[i]);
    preorder(tree, 2*i);
    preorder(tree, 2*i+1);
}

function inorder(tree, i) {
    if(tree[i] === undefined) {
        return;
    }
    inorder(tree, 2*i);
    console.log(tree[i]);
    inorder(tree, 2*i+1);
}

function postorder(tree, i) {
    if(tree[i] === undefined) {
        return;
    }
    postorder(tree, 2*i);
    postorder(tree, 2*i+1);
    console.log(tree[i]);
}

console.log("---------preorder-------------");
preorder(Tree, 1);
console.log("---------inorder-------------");
inorder(Tree, 1);
console.log("---------postorder-------------");
postorder(Tree, 1);


import {Queue} from "./Queue.js";

class Node {
    constructor(value = "") {
        this.value = value;
        this.children = new Map();
        this.isEnd = false; //mark end of the word
    }
}

export class Trie {
    constructor() {
        this.root = new Node();
    }

    insert(string) {
        let currentNode = this.root;

        for (const char of string) {
            if (!currentNode.children.has(char)) {
                currentNode.children.set(
                    char,
                    new Node(currentNode.value + char)
                );
            }
            currentNode = currentNode.children.get(char);
        }
        currentNode.isEnd = true;
    }

    has(string) {
        let currentNode = this.root;

        for (const char of string) {
            if (!currentNode.children.has(char)) {
                return false;
            }
            currentNode = currentNode.children.get(char);
        }
        return currentNode.isEnd;
    }

    autocomplete(string) {
        
        //find node by string
        let currentNode = this.root;
        for (const char of string) {
            if (!currentNode.children.has(char)) {
                return [];
            }
            currentNode = currentNode.children.get(char);
        }

        //find searched history
        const history = [];
        const que = new Queue();
        que.enque(currentNode);
        while (que.size > 0) {
            const curNode = que.deque();
            for (const childNode of curNode.children.values()) {
                if (childNode.isEnd) {
                    history.push(childNode.value);
                }
                que.enque(childNode);
            }
        }
        return history;
    }

}

트리, 트라이로 자동 완성 코드 만들기

git branch 생성과 push

fetch와 switch

🤔 과제 1

🤔 과제 2

🤩 피드백