{"componentChunkName":"component---src-templates-post-template-jsx","path":"/algo/posts/2021-03-19--003","result":{"data":{"site":{"siteMetadata":{"title":"Blog by Eunyoung","subtitle":"작업 기록 블로그","copyright":"© All rights reserved.","author":{"name":"EunYoung","twitter":"#"},"disqusShortname":"","url":"https://ssongey.github.io"}},"markdownRemark":{"id":"3c7014af-7a55-50d9-b4bd-2483e79658cf","html":"

문제

\n

\n \n \n \n \n \n \n \n \n \n

\n\n
class Node {\n    public int value;\n    public Node left, right;\n\n    public Node(int value, Node left, Node right) {\n        this.value = value;\n        this.left = left;\n        this.right = right;\n    }\n}\n\npublic class BinarySearchTree {\n    public static boolean contains(Node root, int value) {\n        throw new UnsupportedOperationException(\"Waiting to be implemented.\");\n    }\n    \n    public static void main(String[] args) {\n        Node n1 = new Node(1, null, null);\n        Node n3 = new Node(3, null, null);\n        Node n2 = new Node(2, n1, n3);\n        \n        System.out.println(contains(n2, 3));\n    }\n}
\n
\n

결과 및 풀이

\n\n

\n \n \n \n \n \n \n \n \n \n

\n\n
public boolean contains(Node root, int value) {\n    Node currentNode = root;\n    \n    while(currentNode != null) {\n        int currentValue = currentNode.value;\n    \n        if(currentValue == value) return true;\n        else if(currentValue > value) currentNode = currentNode.left;\n        else currentNode = currentNode.right;\n    }\n    \n    return false;\n}
\n
\n

배웠다

","fields":{"tagSlugs":["/tags/recursion/","/tags/tree/"],"slug":"/algo/posts/2021-03-19--003"},"frontmatter":{"title":"[TESTDOME] Binary Search Tree","tags":["recursion","tree"],"date":"2021-03-19","description":"recursion, 이진 탐색 트리"}}},"pageContext":{"slug":"/algo/posts/2021-03-19--003"}},"staticQueryHashes":[]}