How to solve a binary search tree question in under 20 mins with Python
We’re kicking off our back to basics series where Liz breaks down common coding interview questions in an interview-like environment. We’ll take a no slides and more coding approach as Liz uses python to walk through how she would approach solving the problem. This week’s problem is focused on using a binary search tree.
The Challenge:
Given a sorted array with unique integer elements, write a function to create a binary search tree with minimal height.
Video Overview:
0:48 The Problem
1:18 Python setup
1:55 Overview of binary search trees
4:50 Coding a solution
16:54 Testing the solution
19:10 Recap
Please subscribe to our channel!
If you have any recommendations for videos you’d like to see, please comment below.
Additional Resources:
Intro to binary trees • Intro to Binary Trees and Breadth First Tr...
Practice hundreds of real coding challenges at https://coderbyte.com/
Need more practice? Check out our channel for more videos on preparing for a coding interview / coderbytedevelopers
Sur cette page du site, vous pouvez voir la vidéo en ligne How to solve a binary search tree question in under 20 mins with Python durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur Coderbyte 21 septembre 2021, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 4,962 fois et il a aimé 95 téléspectateurs. Bon visionnage!
