Skip to content

Leetcode kth smallest element in a bst#25

Open
Igneaalis wants to merge 22 commits intomasterfrom
LEETCODE-kth-smallest-element-in-a-bst
Open

Leetcode kth smallest element in a bst#25
Igneaalis wants to merge 22 commits intomasterfrom
LEETCODE-kth-smallest-element-in-a-bst

Conversation

@Igneaalis
Copy link
Copy Markdown
Owner

Added LEETCODE "kth-smallest-element-in-a-bst" recursive solution.

@Igneaalis Igneaalis requested a review from Vivelapaix June 4, 2020 22:12
# self.left = left
# self.right = right
class Solution(object):
def in_order_traversal(self, root):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Слабо без складывания в дополнительный list ?

Copy link
Copy Markdown
Owner Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@Vivelapaix чисто из интереса - сделаю, но мне пока что нужен зачёт и учить билеты.

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Времени было достаточно, что бы успеть сдать. Без решения того, что я указал, не зачтется

Copy link
Copy Markdown
Owner Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

А стек использовать можно? Или нужен рекурсивный алгоритм?

@Igneaalis Igneaalis added the question Further information is requested label Jun 5, 2020
@Igneaalis Igneaalis requested a review from Vivelapaix June 5, 2020 00:53
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

question Further information is requested

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants