Given a rooted tree with N vertices and N-1 edges. We will be given many pairs of vertices u and v, we need to tell whether u is an ancestor of v or not. Given tree will be rooted at the vertex with index 0.

Examples:

u = 1 v = 6 we can see from above tree that node 1 is ancestor of node 6 so the answer will be yes. u = 1 v = 7 we can see from above tree that node 1 is not an ancestor of node 7 so the answer will be no.

We can solve this problem using depth first search of the tree. While doing dfs we can observe a relation between the order in which we visit a node and its ancestors. If we assign in-time and out-time to each node when entering and leaving that node in dfs then we can see that for each pair of ancestor-descendant the in-time of ancestor is less than that of descendant and out-time of ancestor is more than that of descendant, so using this relation we can find the result for each pair of node in O(1) time.

So time complexity for preprocessing will be O(N) and for the query it will be O(1).

## C++

`// C/C++ program to query whether two node has ` `// ancestor-descendant relationship or not ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Utility dfs method to assign in and out time ` `// to each node ` `void` `dfs(vector<` `int` `> g[], ` `int` `u, ` `int` `parent, ` ` ` `int` `timeIn[], ` `int` `timeOut[], ` `int` `& cnt) ` `{ ` ` ` `// assign In-time to node u ` ` ` `timeIn[u] = cnt++; ` ` ` ` ` `// call dfs over all neighbors except parent ` ` ` `for` `(` `int` `i = 0; i < g[u].size(); i++) { ` ` ` `int` `v = g[u][i]; ` ` ` `if` `(v != parent) ` ` ` `dfs(g, v, u, timeIn, timeOut, cnt); ` ` ` `} ` ` ` ` ` `// assign Out-time to node u ` ` ` `timeOut[u] = cnt++; ` `} ` ` ` `// method to preprocess all nodes for assigning time ` `void` `preProcess(` `int` `edges[][2], ` `int` `V, ` `int` `timeIn[], ` ` ` `int` `timeOut[]) ` `{ ` ` ` `vector<` `int` `> g[V]; ` ` ` ` ` `// construct array of vector data structure ` ` ` `// for tree ` ` ` `for` `(` `int` `i = 0; i < V - 1; i++) { ` ` ` `int` `u = edges[i][0]; ` ` ` `int` `v = edges[i][1]; ` ` ` ` ` `g[u].push_back(v); ` ` ` `g[v].push_back(u); ` ` ` `} ` ` ` ` ` `int` `cnt = 0; ` ` ` ` ` `// call dfs method from root ` ` ` `dfs(g, 0, -1, timeIn, timeOut, cnt); ` `} ` ` ` `// method returns "yes" if u is a ancestor ` `// node of v ` `string isAncestor(` `int` `u, ` `int` `v, ` `int` `timeIn[], ` ` ` `int` `timeOut[]) ` `{ ` ` ` `bool` `b = (timeIn[u] <= timeIn[v] && ` ` ` `timeOut[v] <= timeOut[u]); ` ` ` `return` `(b ? ` `"yes"` `: ` `"no"` `); ` `} ` ` ` `// Driver code to test abovea methods ` `int` `main() ` `{ ` ` ` `int` `edges[][2] = { ` ` ` `{ 0, 1 }, ` ` ` `{ 0, 2 }, ` ` ` `{ 1, 3 }, ` ` ` `{ 1, 4 }, ` ` ` `{ 2, 5 }, ` ` ` `{ 4, 6 }, ` ` ` `{ 5, 7 } ` ` ` `}; ` ` ` ` ` `int` `E = ` `sizeof` `(edges) / ` `sizeof` `(edges[0]); ` ` ` `int` `V = E + 1; ` ` ` ` ` `int` `timeIn[V], timeOut[V]; ` ` ` `preProcess(edges, V, timeIn, timeOut); ` ` ` ` ` `int` `u = 1; ` ` ` `int` `v = 6; ` ` ` `cout << isAncestor(u, v, timeIn, timeOut) << endl; ` ` ` ` ` `u = 1; ` ` ` `v = 7; ` ` ` `cout << isAncestor(u, v, timeIn, timeOut) << endl; ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python program to query whether two node has ` `# ancestor-descendant relationship or not ` ` ` `cnt ` `=` `0` ` ` `# Utility dfs method to assign in and out time ` `# to each node ` `def` `dfs(g: ` `list` `, u: ` `int` `, parent: ` `int` `, timeIn: ` `list` `, timeOut: ` `list` `): ` ` ` `global` `cnt ` ` ` ` ` `# assign In-time to node u ` ` ` `timeIn[u] ` `=` `cnt ` ` ` `cnt ` `+` `=` `1` ` ` ` ` `# call dfs over all neighbors except parent ` ` ` `for` `i ` `in` `range` `(` `len` `(g[u])): ` ` ` `v ` `=` `g[u][i] ` ` ` `if` `v !` `=` `parent: ` ` ` `dfs(g, v, u, timeIn, timeOut) ` ` ` ` ` `# assign Out-time to node u ` ` ` `timeOut[u] ` `=` `cnt ` ` ` `cnt ` `+` `=` `1` ` ` `# method to preprocess all nodes for assigning time ` `def` `preProcess(edges: ` `list` `, V: ` `int` `, timeIn: ` `list` `, timeOut: ` `list` `): ` ` ` `global` `cnt ` ` ` `g ` `=` `[[] ` `for` `i ` `in` `range` `(V)] ` ` ` ` ` `# construct array of vector data structure ` ` ` `# for tree ` ` ` `for` `i ` `in` `range` `(V ` `-` `1` `): ` ` ` `u ` `=` `edges[i][` `0` `] ` ` ` `v ` `=` `edges[i][` `1` `] ` ` ` ` ` `g[u].append(v) ` ` ` `g[v].append(u) ` ` ` ` ` `cnt ` `=` `0` ` ` ` ` `# call dfs method from root ` ` ` `dfs(g, ` `0` `, ` `-` `1` `, timeIn, timeOut) ` ` ` `# method returns "yes" if u is a ancestor ` `# node of v ` `def` `isAncestor(u: ` `int` `, v: ` `int` `, timeIn: ` `list` `, timeOut: ` `list` `) ` `-` `> ` `str` `: ` ` ` `b ` `=` `timeIn[u] <` `=` `timeIn[u] ` `and` `timeOut[v] <` `=` `timeOut[u] ` ` ` `return` `"yes"` `if` `b ` `else` `"no"` ` ` `# Driver Code ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` `edges ` `=` `[(` `0` `, ` `1` `), (` `0` `, ` `2` `), (` `1` `, ` `3` `), (` `1` `, ` `4` `), (` `2` `, ` `5` `), (` `4` `, ` `6` `), (` `5` `, ` `7` `)] ` ` ` `E ` `=` `len` `(edges) ` ` ` `V ` `=` `E ` `+` `1` ` ` ` ` `timeIn ` `=` `[` `0` `] ` `*` `V ` ` ` `timeOut ` `=` `[` `0` `] ` `*` `V ` ` ` `preProcess(edges, V, timeIn, timeOut) ` ` ` ` ` `u ` `=` `1` ` ` `v ` `=` `6` ` ` `print` `(isAncestor(u, v, timeIn, timeOut)) ` ` ` ` ` `u ` `=` `1` ` ` `v ` `=` `7` ` ` `print` `(isAncestor(u, v, timeIn, timeOut)) ` ` ` `# This code is contributed by ` `# sanjeev2552 ` |

*chevron_right*

*filter_none*

Output:

yes no

This article is contributed by **Utkarsh Trivedi**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Relationship between number of nodes and height of binary tree
- Segment Tree | Set 2 (Range Minimum Query)
- LCA for n-ary Tree | Constant Query O(1)
- Iterative Segment Tree (Range Maximum Query with Node Update)
- Iterative Segment Tree (Range Minimum Query)
- Query to find the maximum and minimum weight between two nodes in the given tree using LCA.
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Range query for Largest Sum Contiguous Subarray
- Range and Update Query for Chessboard Pieces
- Queries to search an element in an array and move it to front after every query
- Query to check if a range is made up of consecutive elements
- Convert a Binary Tree into its Mirror Tree
- Convert an arbitrary Binary Tree to a tree that holds Children Sum Property
- Check if a binary tree is subtree of another binary tree | Set 1
- Convert a given tree to its Sum Tree
- Binary Tree to Binary Search Tree Conversion
- Check if a given Binary Tree is height balanced like a Red-Black Tree
- Check if a binary tree is subtree of another binary tree | Set 2
- Convert a Binary Tree to Threaded binary tree | Set 1 (Using Queue)