LCA – Lowest Common Ancestor | ข่าวสารล่าสุดเกี่ยวกับ lca

by adminrecords
28 comments

LCA – Lowest Common Ancestor | ข่าวทั่วไปรายวัน

สำหรับข้อมูลเพิ่มเติมเกี่ยวกับ lca หรือข่าวที่เกี่ยวข้องอื่นๆ โปรดไปที่: https://recordsrecordsrecordsrecords.com/wiki/ การกระทำ

LCA – Lowest Common Ancestor และรูปภาพที่เกี่ยวข้องlca

LCA – Lowest Common Ancestor

LCA – Lowest Common Ancestor


lca และข้อมูลที่เกี่ยวข้อง

บทช่วยสอนเกี่ยวกับอัลกอริทึม LCA เราใช้ Binary Lifting เพื่อรับการประมวลผลล่วงหน้า O(N*log(N)) และ O(log(N)) เพื่อค้นหาบรรพบุรุษร่วมที่ต่ำที่สุดของสองโหนดในทรี

>>> สามารถหาข้อมูลที่น่าสนใจอื่นๆ ได้ที่นี่ เรา
แบ่งปันที่นี่

#LCA #Lowest #Common #Ancestor.

[vid_tags].

LCA – Lowest Common Ancestor.

lca.

เราหวังว่าคุณจะพบข้อมูลเกี่ยวกับ lca ที่นี่
ขอบคุณที่รับชมเนื้อหานี้

You may also like

28 comments

Errichto 07/09/2021 - 18:40

Here are two homework problems for you:
1) Answer queries "find distance between two given nodes U and V" https://cses.fi/problemset/task/1135
2) Given a tree with weighted edges (i.e. every edge has some value), answer queries "given two nodes U and V, find minimum weight along path U-V". (I don't have a source for this one).

Reply
Imran Hussain 07/09/2021 - 18:40

His voice and explanation both are soothing🙂

Reply
Belal Moawad 07/09/2021 - 18:40

your explanation is great, thank u

Reply
Ram Sankar 07/09/2021 - 18:40

can we move from lowest power to highest power? If not why?

Reply
Pratham Kumar 07/09/2021 - 18:40

The preprocessing of vector<vector<int> up will take O(Nlog(N)) time so how this solution TC is O(logN)

Reply
Patryk Wroński 07/09/2021 - 18:40

Thank you Kamil for such a great explanation, keep up the good work:)

Reply
Saiprasad Duduka 07/09/2021 - 18:40

Some of your videos(like this one) are so well made. Thnx🔥

Reply
Ramesh Suresh 07/09/2021 - 18:40

Generally, it is difficult to learn from extra-ordinary people like you. But you are exception to that also. Thank you so much.

Reply
beth suni 07/09/2021 - 18:40

Thanks for the lectures. I like this format a lot: short videos with explanation, code, and example.

Reply
pavan kumar 07/09/2021 - 18:40

what if last for loop goes form 0 to n-1

Reply
Vatsal Agarwal 07/09/2021 - 18:40

I have noticed one thing whicle actually coding for the problem. In the second loop, from LOG – 1 to 0, if we change this to 0 to LOG – 1, the program gives WA for soms tcs. Can someone explain why ? if the LCA is xth ancestor of a and b (after equalizing the depths), does it matter how we access the bits of x. It can be either fromt MSB or LSB. Please clear this concept.

Reply
hk T 07/09/2021 - 18:40

hackercup T-shirt lol

Reply
juan 07/09/2021 - 18:40

Geeeeezz…

Reply
Shubham Kumar 07/09/2021 - 18:40

It's a great initiative by you to teach algorithms. Looking forward for more such great videos. Also add some more practice problems of whatever you explain.

Reply
Michał Z. 07/09/2021 - 18:40

What about time/space complexity of this algorithm? Is it logN like in a binary search? I guess worst case is O(N) when first node is a root and second node is the deepest leaf, right?

Reply
Fahmi PW 07/09/2021 - 18:40

T

Reply
Prasenjit Mondal 07/09/2021 - 18:40

Very Nice explanation. Thanks. Can you do a tutorial on heavy-light decomposition?

Reply
A Z 07/09/2021 - 18:40

im guessing your using a PC, can you share what you are using to
sketch, hardware and program?

Reply
Simone 07/09/2021 - 18:40

Thank you i was searching for this after the binary lifting video 👍

Reply
Gitansh garg 07/09/2021 - 18:40

Great content 🙌💯

Reply
Glauco A. 07/09/2021 - 18:40

Errichto one of the best, I love his videos.

Reply
jose alejandro varon carreño 07/09/2021 - 18:40

is beutiful

Reply
Ariel Rivas 07/09/2021 - 18:40

Can't believe this still F R E E

Reply
Srishtik Dutta 07/09/2021 - 18:40

Please do some tutorials on centroid and heavy light decomposition.

Reply
Kong Zilla 07/09/2021 - 18:40

Nice 🙂

Reply
Вячеслав К 07/09/2021 - 18:40

COME TO BRAZIL !!!

Reply
Alexandru Hrițcan 07/09/2021 - 18:40

I know how to do LCA with RMQ, but this solution is something else
I love it to bits 💚💚

Reply
mizel_11 07/09/2021 - 18:40

I love you bro u help me a lot

Reply

Leave a Comment