Convert Sorted List to Binary Search Tree || Q. 109 || Python, C++, Java || LeetCode Daily Challenge

preview_player
Показать описание
Hi Everyone, In this video we are going to solve a very interesting problem. The name of the problem is, "Convert sorted list to binary search tree". This is a medium level problem based on tree and linkedlist data structure.
We will be covering following parts in this video,
we will clearly understand the problem firstly,
we will understand the height balanced tree,
we will try to find out the logic to solve the problem,
we will see the advantages of sorted linkedlist in problem,
we will find out why we need to find mid of linkedlist every time,
we will discuss the logic part in detail,
At the end we will implement our logic in Python, C++ and Java Programming languages.

Chapters:
0:00 Understanding the problem
3:02 Logic
7:26 Python Implementation
11:22 C++ Implementation
15:42 Java Implementation
Рекомендации по теме
visit shbcf.ru