Binary Search Tree: Traversal & Height - Beau teaches JavaScript

Подписаться 10 млн

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

50% 1

This video builds upon the previous binary search tree video. Find the height of a binary search tree. Also, use use depth-first and breadth-first search through in-order, pre-order, post-order, and level-order traversal.
▶Part 1: • Binary Search Tree - B...
💻 Code: codepen.io/beaucarnes/pen/ryKv...
🔗 Info: en.wikipedia.org/wiki/Binary_...
🐦 Beau Carnes on Twitter: / carnesbeau
⭐JavaScript Playlists⭐
▶JavaScript Basics: • JavaScript Basics Course
▶Data Structures and Algorithms: • Data Structures and Al...
▶Design Patterns: • Design Patterns - Beau...
▶ES6: • ES6 - Beau teaches Jav...
▶Clean Code: • Clean Code - Beau teac...
-
We're busy people who learn to code, then practice by building projects for nonprofits. Learn Full-stack JavaScript, build a portfolio, and get great references with our open source community.
Join our community at freecodecamp.com
Read great tech articles at medium.freecodecamp.com

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

1 апр 2017

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист

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

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

@shadmanmartinpiyal4057 4 года назад

Beau should explain what kind of intuition inspired this implementation of findMinHeight() and findMaxHeight() functions. The levelOrder() was just an ingenious implementation. Nice.

@ClovisNeto 3 года назад

Man, that was an amazing video! Thanks a lot, you explained pretty well and detailed! Congrats bro :)

@sanskarkhare1599 4 года назад

Best teacher ever

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

i'm still confused about the findMinHeight() and findMaxHeight() functions if you could explain each line of code for those functions, that would be great.

@goodwish1543 7 лет назад

Good elaboration. It took me watching it 3 times to completely understand it. ^_^

@jinjashorts 5 лет назад

Hey I am confused about finding the minimum and maximum height can anyone help me

@funkybuddha1598 3 года назад

@@jinjashorts me too help please

@anthonyz9197 3 года назад

Thank you for the video, but I am confused in the min and max functions as you are adding 1 to an object? node.right/node.left would be a an object with value, left, and right properties, so how is it that you can add a number to an object? And how can objects be greater than or less than other objects in the if statements? Sorry, I'm very confused here, I know I'm not understanding something in the code.

@jinjashorts 5 лет назад

Hey I am confused about finding the minimum and maximum height can anyone help me

@dkf28 4 года назад

Same 😭

@evanxg852000 6 лет назад

Hmm Your level order traversal was really complicated for me to implement in python. as I am following along in python. I stumble upon an easier pseudo code that uses queue - Enqueue node - while queue has element - deque node - process node - enqueue node children Great set of tutorials thought.

@shadmanmartinpiyal4057 4 года назад

The level order implementation here is much easier.