3.c) Sorted data to balanced bst || Binary Search Tree

Показать описание

In this video, I have discussed about making a balanced binary search tree data structure(bst) from sorted data.

The algorithm used is to make the middle element as root and recursively build left and right subtree.

Practice questions:

I hope you liked my video, do subscribe to my channel to get the updates of my latest uploads.

#bst #binarysearchtree #binarytree #datastrucuture #algorithm #interviewquestions #placement #internship #faang

Рекомендации по теме

Комментарии

Thank you bhaiya, Your channel is One stop destination,

peehugandhi

Your decision tree concept is just awesome !!

abhishekranjansingh

void buildBST(vector<int>&nums, int start, int end, vector<int>&ans){
if(start>end)
return;
int mid = (start+end)/2;
ans.push_back(nums[mid]);
buildBST(nums, start, mid-1, ans);
buildBST(nums, mid+1, end, ans);

}
vector<int> sortedArrayToBST(vector<int>& nums) {
vector<int>ans;
int n = nums.size();
buildBST(nums, 0, n-1, ans);
return ans;
}

wecan

bhai i have chosen you as my guidance on trees. Waiting for more topics now on BST as you pictured in the first video. Thank you for making me believing that i can also understand tree and code the same :D More power to you !!

PS - When are you uploading next ?? ;-)

TusharRaj

Gold level contents, all your videos are very simple and easy to understand, thanks for your help buddy, after aditya verma you are the person who is teaching recursion in his own style.

shashankshekhar

class Solution {
public:
void buildBST(vector<int>&nums, int start, int end, vector<int>&ans){
if(start>end)
return;
int mid = (start+end)/2;
ans.push_back(nums[mid]);
buildBST(nums, start, mid-1, ans);
buildBST(nums, mid+1, end, ans);

}
vector<int> sortedArrayToBST(vector<int>& nums) {
vector<int>ans;
int n = nums.size();
buildBST(nums, 0, n-1, ans);
return ans;
}
};

manikanth.

this is kashish mahendiratta is missing kashish bhai after hello everyone, ... badly missing

HIMANSHUVERMA-wuhc

waiting for more interesting questions😁🔥

abhishekvishwakarma

3.c) Sorted data to balanced bst || Binary Search Tree

3.c) Sorted data to balanced bst || Binary Search Tree

Sorted Array to Balanced BST | GeeksforGeeks

Convert Sorted Array To Balanced Binary Search Tree | Sorted Array to BST

Create a balanced Binary Search Tree (BST) from a sorted array

LeetCode 109 Conquered! Sorted List to Balanced BST (C++) - Efficient Conversion

BST - 22: Construct Balanced BST from given values | Sorted Array to Balanced BST

Convert Sorted Array to Balanced Binary Search Tree

Build Balanced BST from Sorted Array | C++ Placement Course | Lecture 28.5

HOMELAB: A definitive guide to using iPerf3 to measure network performance! (Part 2)

Avl tree | Data Structure height balancing with creation Delection Rotation and sort integer | c++

Sorted List To Balanced Binary Search Tree | Sorted Linked List To BST

Convert sorted array to a balance binary search tree

Part - 5: Binary Search Tree Balanced BST from Sorted Array

1 03 Creating a Balanced Binary Search Tree from a Sorted List

10.1 AVL Tree - Insertion and Rotations

Radix Sort with Height Balance Binary Tree

12.a) Construct balanced bst from sorted linked list

13.22 SORTED ARRAY TO BALANCED BST(Tree)-Interviewbit #tree#programming#bst

Three EASY Ways to Find and Remove Duplicates in Excel

Coding Interview Convert Sorted Array to height balanced Binary Search Tree

Learn Binary search trees in 20 minutes 🔍

Convertion of Sorted Linked List to Balanced Binary Search Tree

How to create Balanced BST from sorted array | DSA | Trees

What's the fastest way to alphabetize your bookshelf? - Chand John