Amazon Coding Interview: Is this a Binary Search Tree?

Published: 15 August 2021
on channel: Easy Theory

779

Here we tackle the question of determining, given a binary tree, whether it is a binary search tree. The key to note is that any node is the "root" of some tree, so any node to the left of it must be at most its value, and any to the right must be at least that value. So the important part of the algorithm is to "filter down" the value of the node to the two children based on which direction the child is (either left or right).

Easy Theory Website: https://www.easytheory.org
Discord: / discord

If you like this content, please consider subscribing to my channel: / @easytheory

▶SEND ME THEORY QUESTIONS◀
ryan.e.dougherty@icloud.com

▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.

On this page of the site you can watch the video online Amazon Coding Interview: Is this a Binary Search Tree? with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 15 August 2021, share the link with friends and acquaintances, this video has already been watched 779 times on youtube and it was liked by 27 viewers. Enjoy your viewing!

2,280