Binary Tree- level wise insertion in a binary tree

Поділитися
Вставка
  • Опубліковано 19 вер 2024

КОМЕНТАРІ • 2

  • @divyadsouza9628
    @divyadsouza9628 2 роки тому +1

    Really nice explanation of the concept! One suggestion though, try using more descriptive variable names. It's okay if they look longer. Like 'k' could be changed to something like 'data' or 'valueFromList' and 'm' could be something like 'parentNode' or 'position'. It makes your code more readable.

    • @pratiksen7809
      @pratiksen7809  2 роки тому

      Sure. Thank you for the suggestions 🙂