Зарегистрироваться
Восстановить пароль
FAQ по входу

Chatterjee A., Kiao U. 7 days with Binary Tree

  • Файл формата pdf
  • размером 1,65 МБ
  • Добавлен пользователем
  • Описание отредактировано
Chatterjee A., Kiao U. 7 days with Binary Tree
OpenGenus, 2021. — 44 p.
Binary Tree is one of the most important Data Structure (for Coding Interviews and Real Life System Design) and is equally challenging. With practice and correct way of thinking, you can master it easily and know when to use it in real life problems.
We will attempt one problem every day in the week and analyze the problem deeply.
Our schedule:
Day 1: Introduction to Binary Tree + Problem 1
Day 2: Check if a Binary Tree is Balanced by Height
Day 3: Find nodes which are at a distance k from root in a Binary Tree
Day 4: Modification of Day 3 Problem
Day 5: Find minimum or maximum element in Binary Search Tree
Day 6: Find kth smallest element in Binary Search Tree
Day 7: Modification of Day 6 Problem
On following this routine sincerely, you will get a strong hold on Binary Tree data structure quickly and will be able to attempt interview and real-life problems easily.
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация