Recover a Tree From Preorder Traversal – Leetcode 1028 – Python

学習

🚀 https://neetcode.io/ – A better way to prepare for Coding Interviews

🧑‍💼 LinkedIn: https://www.linkedin.com/in/navdeep-singh-3aaa14161/
🐦 Twitter: https://twitter.com/neetcode1

⭐ BLIND-75 PLAYLIST: https://www.youtube.com/watch?v=KLlXCFG5TnA&list=PLot-Xpze53ldVwtstag2TL4HQhAnC8ATf

Problem Link: https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/

0:00 – Read the problem
0:30 – Drawing Explanation
15:26 – Coding Explanation

leetcode 1028

#neetcode #leetcode #python

コメント

  1. @hrishii.02 より:

    Couldn’t really solve on my own. The relation between Len(stack) and depth was beautiful, once I got that from the video was able to code it on my own!

  2. @Ahmad-h3z1v より:

    w stache btw

タイトルとURLをコピーしました