Binary Search Tree Iterator - Leetcode 173 - Python

Подписаться 745 тыс.

Просмотров 36 тыс.

50% 1

🚀 neetcode.io/ - A better way to prepare for Coding Interviews
🥷 Discord: / discord
🐦 Twitter: / neetcode1
🐮 Support the channel: / neetcode
⭐ BLIND-75 PLAYLIST: • Two Sum - Leetcode 1 -...
💡 DYNAMIC PROGRAMMING PLAYLIST: • House Robber - Leetco...
Problem Link: leetcode.com/problems/binary-...
0:00 - Read the problem
1:30 - Drawing Explanation
9:47 - Coding Explanation
leetcode 173
This question was identified as an interview question from here: github.com/xizhengszhang/Leet...
#meta #interview #python
Disclosure: Some of the links above may be affiliate links, from which I may earn a small commission.

Наука

Опубликовано:

6 июл 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 34

@lakshyasaharan5348 2 года назад

Your voice so soothing and smooth.

@numberonep5404 2 года назад

ikr!!!!!!!

@calebi23 2 года назад

Exactly!

@carloscarrillo201 2 года назад

You're a good man, NeetCode. Thanks!

@manishk2429 2 года назад

Me: The perfect intro doesn't exi- NeetCode: Let's write some more NeetCode today Me: (Throws earphones in the air) THERE IT IS !!!

@shantanukumar4081 2 года назад

Great Explanation !!!

@ChanChan-pg4wu 2 года назад

You are always very helpful! I wish I could work with you in the future!

@ankitgoel6131 2 года назад

Omg! Thank you so much! I love your videos Neetcode! Just curious, could you also solve Perfect Rectangles?

@essamobeid1507 2 года назад

amazing solution! thanks a lot for posting:)

@kostaad 2 года назад

I wonder if a yield based solutions with co-routines will be sufficient for an interviewer.

@xjlonelystar 2 года назад

Man U doing more leetcode than me and u already have a job ☠️

@usmanakram5191 2 года назад

Does there exists a solution with O(1) space complexity for this problem?

@charleskorey6515 Год назад

Yes there exists but then you have to do o(n) search everytime and it won’t be an iterator anymore. If you count recursion stack then o(1) is not possible

@ibrahimalshubaily9520 2 года назад

Still dont get why does has next work?

@DavidDLee Год назад

You CAN do it recursively in Python by writing a Generator function, which uses *yield* and *yield from.* The end result is a very clean in-order recursive traversal that's been consumed sequentially, but with O(h) memory ( O(1) for our own state + O(h) where Python keeps track of the generator state).

@bhanuvarma1239 Месяц назад

In the given question they asked that implement in the ""In-order Traversal""...But you did it in the ""pre-Order"" ##In-order traversal 1.left node 2.root node 3.right node 👉👉Please clear my doubt sir🙏🙏

@lucashowes4089 2 года назад

Ik google prolly pays you a bag but they might be wasting your talents. Haven't had online instruction this quality since khan academy

@ngneerin 8 месяцев назад

This comment ruined his life. Now he does his thing for peanuts

@sprajosh 6 месяцев назад

@@ngneerin😂😂 I think he’ll figure out what to do with his life

@eva__4380 2 месяца назад

😂😂😂😂😂@@ngneerin

@zohahs5276 2 года назад

how good one has to be in maths to solve these algos?

@MysteriousIndiaYT 2 года назад

Bro i am expert in python. But very confused, which career i have to choose for my life. Django Developer vs Data Scientist? Can anyone please guide me. I have little knowledge of both

@Ankit-hs9nb 2 года назад

Be a machine learning engineer I am a Data Scientist with 4 years of experience and now switching to Machine Learning engineer

@sidazhong2019 7 месяцев назад

@@Ankit-hs9nb The Machine Learning engineer minium requirement is PHD.

@dewangpatil4990 2 года назад

Hello Sir i am a big fan......I have a very important request....... Could you please make solution playlist of Striver's SDE Sheet. Its will be very beneficial for us students

@CommandantNOVA 2 года назад

A lot of problems on the sheet overlap with the leetcode top 75. There's a top 75 playlist already.

@srx2106 9 месяцев назад

for some reason the constructor keeps going over my head

@harshavardhanveerannanaval8605 2 года назад

Can someone please verify if it could be done this way? class BSTIterator: def __init__(self, root: Optional[TreeNode]): arr=[] def flatten(root): if(root): flatten(root.left) arr.append(root.val) flatten(root.right) flatten(root) self.arr=arr def next(self) -> int: return(self.arr.pop(0)) def hasNext(self) -> bool: return(self.arr) I just done a inorder traversal before hand and store it in an array

@adriandelfin8047 2 года назад

How do I cope with so many failures in a few months

@Anon-xz6hu 2 года назад

Look at your goals, if you are doing progress, no matter how small, don't give up, learn from failures, see what went wrong, why it went wrong, improve and adapt. Have faith in yourself.