-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
5 1 #5
base: master
Are you sure you want to change the base?
5 1 #5
Conversation
|
||
void Height(std::vector<TreeNode> &v, int index) { | ||
for (auto elem: v[index].Children) { | ||
if (v[elem].Height_ + 1 >= v[index].Height_) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Непонятно, что здесь происходит. Два хейта зачем-то )
Напишите комментарии, пожалуйста.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Это все по вашей тактике, храним для каждой вершины 2 высоты, две наибольшие высоты (проходят через разный детей вершины)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Я просто хотел увидеть комментарии в коде. Но и так принято. )
No description provided.