조회 수 561 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄 첨부
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄 첨부

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

Given binary search tree:  root = [6,2,8,0,4,7,9,null,null,3,5]

 

Example 1:

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
Output: 6
Explanation: The LCA of nodes 2 and 8 is 6.

Example 2:

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
Output: 2
Explanation: The LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

 

Note:

  • All of the nodes' values will be unique.
  • p and q are different and both values will exist in the BST.


/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        TreeNode pNode = p;
        TreeNode qNode = q;
        TreeNode node = root;
        
        while(node != null){
            TreeNode parent = node;
            
            if(parent.val < qNode.val && parent.val < pNode.val){
                node = node.right;
            }else if(qNode.val < parent.val && pNode.val < parent.val){
                node = node.left;
            }else{
                return node;
            }
        }
        return null;
    }
}


/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        TreeNode pNode = p;
        TreeNode qNode = q;
        
        if(root.val < qNode.val && root.val < pNode.val){
            return lowestCommonAncestor(root.right, p, q);
        }else if(qNode.val < root.val && pNode.val < root.val){
            return lowestCommonAncestor(root.left, p, q);
        }
        return root;
    }
}

[문제] https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 720. Longest Word in Dictionary hooni 2020.05.07 653
76 Leetcode 697. Degree of an Array hooni 2020.05.05 617
75 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 571
» Leetcode 235. Lowest Common Ancestor of a Binary Search Tree file hooni 2020.05.01 561
73 Leetcode 532. K-diff Pairs in an Array hooni 2020.05.04 559
72 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 557
71 Leetcode 687. Longest Univalue Path hooni 2020.05.01 556
70 Leetcode 997. Find the Town Judge hooni 2020.05.02 553
69 Leetcode 724. Find Pivot Index hooni 2020.05.05 548
68 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 537
67 Leetcode 605. Can Place Flowers hooni 2020.05.05 530
66 Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 528
65 Leetcode 844. Backspace String Compare hooni 2020.05.05 526
64 Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 517
63 Leetcode 56. Merge Intervals hooni 2020.05.05 516
62 Leetcode 628. Maximum Product of Three Numbers hooni 2020.05.05 506
61 Leetcode 876. Middle of the Linked List hooni 2020.05.04 501
60 Leetcode 448. Find All Numbers Disappeared in an Array hooni 2020.05.05 498
59 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 491
58 Leetcode 270. Closest Binary Search Tree Value hooni 2020.05.01 484
Board Pagination Prev 1 2 3 4 Next
/ 4