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)
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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)
Название |
---|
$$$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