11.c) Construct complete binary tree from linked list

preview_player
Показать описание
In this video, I have discussed about converting a single linked list to complete binary tree data structure.

The algorithm used is, to create a node at postition i and then create its child nodes at position 2*i+1 and 2*i+2 which is the property of complete binary tree.

Practice questions:

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

#binarytree #datastrucuture #algorithm #interviewquestions #placement #internship #recursion
Рекомендации по теме
Комментарии
Автор

Mera trees ka maximum practise aapke videos se hi horaha hai bhaiya, BST par bhi video lana please.

abhishekranjansingh
Автор

What a great explanation!..your voice is so calm😄

surbhitamrakar
Автор

Nice content kashish I just take the challenge to complete this BT series today and can't wait to see your BST series👌👌

abhishekvishwakarma
Автор

what is meaning of this line v[i]->left??? coz vector has no left and right

jasmeenkaur
Автор

Bro...Teach in English!!....so that everyone from south india can understand

gamingwithhemend
visit shbcf.ru