Skip to content

236. Lowest Common Ancestor of a Binary Tree #76

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 21, 2019

Conversation

zwfang
Copy link
Collaborator

@zwfang zwfang commented Feb 21, 2019

@zwfang zwfang added Medium Coefficient of difficulty medium binary tree a binary tree is a tree data structure in which each node has at most two children labels Feb 21, 2019
@zwfang zwfang marked this pull request as ready for review February 21, 2019 04:18
@codecov
Copy link

codecov bot commented Feb 21, 2019

Codecov Report

Merging #76 into master will increase coverage by 0.01%.
The diff coverage is 100%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master      #76      +/-   ##
==========================================
+ Coverage   99.36%   99.36%   +0.01%     
==========================================
  Files         115      116       +1     
  Lines        2012     2022      +10     
==========================================
+ Hits         1999     2009      +10     
  Misses          9        9              
  Partials        4        4
Impacted Files Coverage Δ
...236_Lowest_Common_Ancestor_of_a_Binary_Tree/lca.go 100% <100%> (ø)

@zwfang zwfang merged commit 11fb1ef into master Feb 21, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
binary tree a binary tree is a tree data structure in which each node has at most two children Medium Coefficient of difficulty medium
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant