Пікірлер

• 
  @rakibtaherКүн бұрын

  v aijan nice r o video chai

• 
  @SureshChakma-mw7bl2 күн бұрын

  আপনার বইটি রকমারতে নট এভেইলএবল দেখাচ্ছে... কবে আপনি এটি আরও প্রিন্ট করবেন নতুন করে... এটা আমি নিতে চাই.... প্লিজ আরও প্রিন্ট করুন।

• 
  @Siulibadi6 күн бұрын

  😅

• 
  @onto71046 күн бұрын

  /* Deleting a node from Binary search tree */ #include<iostream> using namespace std; struct Node { int data; struct Node *left; struct Node *right; }; //Function to find minimum in a tree. Node* FindMin(Node* root) { while(root->left != NULL) root = root->left; return root; } // Function to search a delete a value from tree. struct Node* Delete(struct Node *root, int data) { if(root == NULL) return root; else if(data < root->data) root->left = Delete(root->left,data); else if (data > root->data) root->right = Delete(root->right,data); // Wohoo... I found you, Get ready to be deleted else { // Case 1: No child if(root->left == NULL && root->right == NULL) { delete root; root = NULL; } //Case 2: One child else if(root->left == NULL) { struct Node *temp = root; root = root->right; delete temp; } else if(root->right == NULL) { struct Node *temp = root; root = root->left; delete temp; } // case 3: 2 children else { struct Node *temp = FindMin(root->right); root->data = temp->data; root->right = Delete(root->right,temp->data); } } return root; } //Function to visit nodes in Inorder void Inorder(Node *root) { if(root == NULL) return; Inorder(root->left); //Visit left subtree printf("%d ",root->data); //Print data Inorder(root->right); // Visit right subtree } // Function to Insert Node in a Binary Search Tree Node* Insert(Node *root,char data) { if(root == NULL) { root = new Node(); root->data = data; root->left = root->right = NULL; } else if(data <= root->data) root->left = Insert(root->left,data); else root->right = Insert(root->right,data); return root; } int main() { /*Code To Test the logic Creating an example tree 5 / \ 3 10 / \ \ 1 4 11 */ Node* root = NULL; root = Insert(root,5); root = Insert(root,10); root = Insert(root,3); root = Insert(root,4); root = Insert(root,1); root = Insert(root,11); // Deleting node with value 5, change this value to test other cases root = Delete(root,5); //Print Nodes in Inorder cout<<"Inorder: "; Inorder(root); cout<<" "; } why one function use left and other fuction use oppsite this { while(root->left != NULL) root = root->left; return root; } and this-> struct Node *temp = FindMin(root->right); root->data = temp->data; root->right = Delete(root->right,temp->data);

• 
  @rimanahar331313 күн бұрын

  Sir i am student of daffodil int uni. i really love your videos. you are really a good teacher . Allah will helps you as you helps us. you are a honest, intelligant, brilliant person.

• 
  @enamulhaqueshagor488017 күн бұрын

  boita kothay pabo vhai, kindly janaben,,

• 
  @FarhanHossan17 күн бұрын

  Rokomari te ase, or amar thekeo nite parben. Nicher ei number e contact korun please. 01962782594

• 
  @sujaydas399517 күн бұрын

  From west bengal, currently I'm pursuing my BTech in CSE from MAKAUT University. Your explanations are awesome 💯, and the lectures are legendary. Keep it up ! Love from West Bengal, India ❤

• 
  @remonroy3418 күн бұрын

  vai mattro start korchi....video long hoilaow bujar kno scope nei,sundor vbe bujanor jnno onk kretoggo..go ahead.

• 
  @Hypika18 күн бұрын

  vaia ji ap to deba nikla re❤

• 
  @esmotjahan896518 күн бұрын

  Vaia ami sob poresilam ar aytai bad diyesilam exam a atai aslo😥😥

• 
  @user-fb7tx2fx5i18 күн бұрын

  I/o বলতে কি বুঝিয়েছেন operating system naki

• 
  @zubairalam772618 күн бұрын

  Vai ekhane selection operator ta use hoilobna kn??

• 
  @BigganiThe3N19 күн бұрын

  ব্রো, ভুলভাল পড়াইয়েন না, এক্সটার্নাল ফ্র্যাগমেন্টেশন ঘটে ডাইনামিক মেমোরি অ্যালোকেশন এর সময়, ফিক্সড সাইজ মেমোরি ব্লকের সময়ে নয়। 3:50 ডাইনামিক মেমোরি অ্যালোকেশন এ, কোনো প্রসেস যদি তার প্রয়োজনীয় স্পেস মেমোরিতে ফাঁকা থাকা সত্ত্বেও স্পেস পাশাপাশি না থাকার (Non contiguous) কারণে প্রসেস লোড হয় না, এর ফলে যে ফ্র্যাগমেন্টেশন ঘটে সেটাই এক্সটার্নাল ফ্র্যাগমেন্টেশন। এক্সটার্নাল ফ্র্যাগমেন্টেশন এর আপনি যে উদাহরণ এবং ব্যাখ্যা তা সঠিক নয়। ভিডিও তৈরির আগে একটু ভালো ভাবে পড়াশুনা করে বানানো উচিত, প্রয়োজনে স্ক্রিপ্ট লিখে । শুভকামনা 🙏

• 
  @khokanmahmud915619 күн бұрын

  Writting need to be more transparent and understandable. Else you are a good tutor. Keep it up.

• 
  @aftabuzzaman745920 күн бұрын

  Thanks a lot. Well explanation. Save me a lot of time.

• 
  @always_binging0121 күн бұрын

  These are very basic. Try to solve the complex ones something students will be able to learn

• 
  @rifatjahan577922 күн бұрын

  Thanks

• 
  @JahidulIslam-dp2pv22 күн бұрын

  Apnar desher bari kothay ?

• 
  @rahimulislam447022 күн бұрын

  Thank you from daffodil

• 
  @Entertainment-fl6ep23 күн бұрын

  via kolomer kali sesh er dike

• 
  @user-cd5cq4pt8u23 күн бұрын

  ❤❤

• 
  @oldmovie36024 күн бұрын

  Nice ❤❤❤❤

• 
  @sirizvy479424 күн бұрын

  ❤

• 
  @faiyazmahmud795627 күн бұрын

  Thank u soo much

• 
  @masfiqmahmud14528 күн бұрын

  ayhay bhai er basay dekhi sir poka

• 
  @TowhidAlomGUB28 күн бұрын

  Bhaia, eta ki fractional knapsack problem ?

• 
  @mdnasiruddin285929 күн бұрын

  Excellent

• 
  @sms107129 күн бұрын

  amar varsityr lecturer banglay video dekhar jonno apnar channel suggest koreche class e...ami ege thekei apnar vid dekhi

• 
  @FarhanHossan24 күн бұрын

  Thank you so much 💗💗. Sir/Mam k amar Salam janaben please ☺

• 
  @jubayeracademy618929 күн бұрын

  Which through way conduct the course like zoom, or etc

• 
  @FarhanHossan24 күн бұрын

  Convay

• 
  @ismailhossen2485Ай бұрын

  priyority same hole ki korbo????

• 
  @oldmovie36023 күн бұрын

  Arrival time dekhbo, ar arrival time o jodi same hay tahole sequence dekhbo.

• 
  @priyoghoshАй бұрын

  RT for P4= 0 cause first process id P4

• 
  @rimislamalifАй бұрын

  Extraordinarily

• 
  @sohanahmed4311Ай бұрын

  P4 er waiting time 0 hoar kotha cause ashce 0th second a r kaj kora suru korce 0 th second thekei...

• 
  @humanscienceanimal8599Ай бұрын

  ❤

• 
  @anickkhanАй бұрын

  Theory of Computing er upor ki korben?

• 
  @kuntalkundu4172Ай бұрын

  "Thank you, Mr. Hossain, for the excellent DBMS tutorial! Your explanations are really clear and helpful. Could you please consider creating a tutorial series on Python as well? I think your teaching style would make learning Python enjoyable and straightforward. Looking forward to more great content from you!"

• 
  @md.tajulislam7107Ай бұрын

  ভেলু গুলোর যোগ কিভাবে?

• 
  @aksashiq9787Ай бұрын

  2:28

• 
  @md.al-amintech852Ай бұрын

  FIRST view in me🙂

• 
  @ReduanAhmadRaselАй бұрын

  Example 2 te right sub tree er minimum value 9.

• 
  @mahmudhossain7619Ай бұрын

  jara course korbe tader sathe ki live er class video share kora hobe ?

• 
  @FarhanHossan24 күн бұрын

  JI

• 
  @user-wt1bd1te5oАй бұрын

  Following your vedio since 2021. Your content are very simple and easily understable that help us so much for university exam. Good wishes❤

• 
  @Dailylifeofagovt.jobaspirantАй бұрын

  Aktu vul hoice -write buffer hobe na write hobe database a

• 
  @AlaminIslam-hi8dlАй бұрын

  Nice explanation bhaiya

• 
  @AlaminIslam-hi8dlАй бұрын

  Bhaiya apnr MySQL book e DB transaction normalization niye discussion kora ache ?

• 
  @Dailylifeofagovt.jobaspirantАй бұрын

  Write operation korle to database value ta add hoy. Tahole jodi commit na kori jeheto write kora hoice tahole to rollback koda possible na..

• 
  @tahmid6249Ай бұрын

  Bhaiya UIU te Data science er upor bsc kora kototah worth it hobe.?

• 
  @mdabdulkayumkhokan7563Ай бұрын

  Thank you

• 
  @mdabdulkayumkhokan7563Ай бұрын

  ❤❤

• 
  @mdabdulkayumkhokan7563Ай бұрын

  Thank you bai