Convert Sorted Array to Binary Search Tree | Leetcode 108 | Live coding session

preview_player
Показать описание
Here is the solution to "Convert Sorted Array to Binary Search Tree" leetcode question. Hope you have a great time going through it.

Solution

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 2:30 Solution for Convert Sorted array to BST
4) 4:00 Time Complexity

PS : Please increase the speed to 1.25X
  1. Coding Decoded
  2. leetcode
  3. codingdecoded
Рекомендации по теме
Convert Sorted Array 0:09:54

Convert Sorted Array to Binary Search Tree - Leetcode 108 - Python

Convert Sorted Array 0:09:05

Convert Sorted Array to Binary Search Tree (LeetCode 108. Algorithm Explained)

Convert sorted array 0:05:39

Convert sorted array to binary search tree

LeetCode #108 - 0:04:33

LeetCode #108 - Convert Sorted Array to Binary Search Tree

Convert Sorted Array 0:06:03

Convert Sorted Array to Binary Search Tree

Convert sorted array 0:06:50

Convert sorted array to binary search tree | LeetCode 108 | Easy

LeetCode 108. Convert Sorted 0:06:41

LeetCode 108. Convert Sorted Array to Binary Search Tree

LeetCode 108. Convert 0:08:31

LeetCode 108. Convert Sorted Array to Binary Search Tree - Interview Prep Ep 71

13.1 - Searching 0:55:13

13.1 - Searching & Sorting (2024-11-20)

[Java] Leetcode 108. 0:05:53

[Java] Leetcode 108. Convert Sorted Array to Binary Search Tree [Binary Search Tree #1]

Convert Sorted Array 0:04:42

Convert Sorted Array to BST | Leetcode - 108 | Trees #14

LEETCODE 108 (JAVASCRIPT) 0:08:58

LEETCODE 108 (JAVASCRIPT) | CONVERT SORTED ARRAY TO BINARY SEARCH TREE

Convert Sorted Array 0:05:31

Convert Sorted Array to Binary Search Tree - Leetcode 108 - Java

Convert Sorted Array 0:05:33

Convert Sorted Array to Binary Search Tree - Leetcode 108 - Java

108. Convert Sorted 0:09:47

108. Convert Sorted Array to Binary Search Tree | LEETCODE EASY | TREE | CODE EXPLAINER

LeetCode 108 - 0:06:25

LeetCode 108 - Convert Sorted Array to Binary Search Tree (JavaScript)

Convert Sorted Array 0:05:53

Convert Sorted Array to Binary Search Tree | 🚀 August LeetCode 🚀 | C++ | 🔥 Daily Challenge 🔥...

Разбор задачи Leetcode 0:03:02

Разбор задачи Leetcode 108 Convert Sorted Array to Binary Search Tree

Convert Sorted Array 0:05:03

Convert Sorted Array to Binary Search Tree | Leetcode 108 | Live coding session

108. Convert Sorted 0:12:00

108. Convert Sorted Array to Binary Search Tree

How To Convert 0:10:12

How To Convert A Sorted Array To A Binary Search Tree - LeetCode 108

Convert Sorted Array 0:09:07

Convert Sorted Array to Binary Search Tree | Amazon | Leetcode#108 | Java | Technical Interview

Convert Sorted Array 0:12:38

Convert Sorted Array To Binary Search Tree | Leetcode Python Solution | Python

108. Convert Sorted 0:09:00

108. Convert Sorted Array to Binary Search Tree - Day 26/31 Leetcode July Challenge

Комментарии
Автор

Easy true, I think you have already done a similar question in the past.

neetugoyal
Автор

what is the time complexity of this approach ?

TreeNode root=null;


//Time complexity of this approach is o(nlogn);
//Space complexity is o(1);
public TreeNode sortedArrayToBST(int[] nums) {
constructBST(nums, 0, nums.length - 1);
return root;
}

private void constructBST(int[] nums, int low, int high) {

if (low > high)
return ;

int mid = low + (high - low) / 2;

if (root == null)
root = new TreeNode(nums[mid]);
else {
TreeNode node = new TreeNode(nums[mid]);
TreeNode cur=root;
TreeNode tail=null;
while (cur!=null){
if(node.val<cur.val) {
tail=cur;
cur = cur.left;
}
else {
tail=cur;
cur = cur.right;
}
}
if(node.val<tail.val)
tail.left=node;
else
tail.right=node;
}
constructBST(nums, low, mid - 1);
constructBST(nums, mid + 1, high);
}


Thanks in advance.

praveenj