we have given rooted tree , and target node and some other node A, we have to check if target node present in simple path from root to A , please tell me how to check this in o(1)
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 148 |
9 | pajenegod | 145 |
10 | orz | 144 |
we have given rooted tree , and target node and some other node A, we have to check if target node present in simple path from root to A , please tell me how to check this in o(1)
Name |
---|
$$$timein[x]$$$ is when you enter $$$x$$$ and $$$timeout[x]$$$ is when you leave $$$x$$$, these values can be calculated as below:
If $$$a$$$ is an ancestor of $$$b$$$ only if this inequality is satisfied: $$$timein[a] ≤ timein[b] ≤ timeout[a]$$$. To check if some node $$$x$$$ presents in the simple path from root to $$$a$$$, it is enough to check if the root is an ancestor of $$$x$$$ and $$$x$$$ is an ancestor of $$$a$$$. We have to pre process in $$$O(n)$$$ then we can answer query in $$$O(1)$$$.
Could a O(logn) solution be that if LCA of target node and the given node A is target node itself, it is present. Else, it is not?
You can also use LCA in $$$O(1)$$$ though