Leetcode: Lowest Common Ancestor Of Two Nodes - Qiita

require 'minitest/autorun' require 'pry' class LowestCommonAncestorOfTwoNodes < Minitest::Test def test_run root = [3, 5, 1, 6, 2, 0, 8, nil, nil, 7, 4] p = 5 q = 1 tree = TreeNode.new(3) tree.left = TreeNode.new(5) tree.left.left = TreeNode.new(6) tree.left.right = TreeNode.new(2) tree.left.right.right = TreeNode.new(4) tree.left.right.left = TreeNode.new(7) tree.right = TreeNode.new(1) tree.righ