-
Notifications
You must be signed in to change notification settings - Fork 0
/
100-binary_trees_ancestor.c
63 lines (55 loc) · 1.27 KB
/
100-binary_trees_ancestor.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include "binary_trees.h"
/**
* binary_trees_ancestor - finds the lowest common ancestor of two nodes
* @first: a pointer to the first node to find the ancestor
* @second: a pointer to the second node to find the ancestor
*
* Return: pointer to the ancestor node
* NULL if there is no ancestor node
*/
binary_tree_t *binary_trees_ancestor(const binary_tree_t *first,
const binary_tree_t *second)
{
size_t depth_first, depth_second;
if (!first || !second)
return (NULL);
depth_first = binary_tree_depth(first);
depth_second = binary_tree_depth(second);
while (depth_first > depth_second)
{
first = first->parent;
depth_first--;
}
while (depth_second > depth_first)
{
second = second->parent;
depth_second--;
}
while (first && second)
{
if (first == second)
return ((binary_tree_t *)first);
first = first->parent;
second = second->parent;
}
return ((binary_tree_t *)first);
}
/**
* binary_tree_depth - measures the depth of a node in a binary tree
* @tree: node to calculate the depth of
*
* Return: depth of the node
* 0 if tree is NULL
*/
size_t binary_tree_depth(const binary_tree_t *tree)
{
size_t depth = 0;
if (!tree)
return (0);
while (tree->parent)
{
depth++;
tree = tree->parent;
}
return (depth);
}