Convert Sorted Array to Binary Search Tree | Array to BST | LeetCode 108

preview_player
Показать описание
Convert Sorted Array to Balanced Binary Search Tree
Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.
A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.

00:00 Problem Statement
00:27 What is Binary Search Tree (BST)
00:55 What is Balanced Binary Search Tree
01:49 Algorithm Explained - Example 1
03:30 Algorithm Explained - Example 2
05:42 Coding Session
07:43 Code Execution

#ArrayToBST #SortedArrayToBinarySearchTree #SortedArrayToBST #Facebook #Google #MicroSoft #Amazon
Рекомендации по теме