GOOGLE - CONVERT SORTED ARRAY TO BINARY SEARCH TREE (LeetCode)

One of Google's most commonly asked interview questions according to LeetCode.

Coding Interviews Convert Sorted Array to Binary Search Tree (LeetCode) question and explanation.

This interview question is commonly asked by the following companies: Google and Apple.

Problem description: Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:
Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

0
/ \
-3 9
/ /
-10 5

Support me on Patreon: https://www.patreon.com/KevinNaughtonJr
Follow me on GitHub: https://github.com/kdn251
Follow me on Instagram: https://www.instagram.com/programeme

Видео GOOGLE - CONVERT SORTED ARRAY TO BINARY SEARCH TREE (LeetCode) канала Kevin Naughton Jr.