Tree Data Structure | Illustrated Data Structures

So far in this series, we have looked at the arrays, linked lists, stacks, queues, and hash tables, all of which were linear data structures. In this illustrated explanation, we learn about trees which are the hierarchical data structure. We cover the basics of trees, some real-world usage of tree data structure, different types of trees, different operations you can perform on the tree data structure and their complexity, and how to traverse a tree. After watching this video, you will be able to answer the following questions:

What is a hierarchical data structure?
What is tree data structure?
What are nodes, edges, leaf nodes, root nodes, parent nodes, and grandparent nodes in trees?
How to calculate tree height?
How to calculate the node height?
What are the different types of tree data structures?
What is the difference between a binary tree and a binary search tree?
What are the properties of a binary search tree?
How do we search for elements in a tree?
How to insert elements in a tree?
What is the complexity of search and insert operations in trees?
What's the difference between Balanced and Unbalanced Trees?
How to traverse a tree?
Difference between pre-order, in-order, and post-order tree traversal.

Data Structures Playlist:
   • Data Structures Illustrated  

Channel website:
https://roadmap.sh

Discord Community:
  / discord  

Find us on the internet:
  / roadmapsh  
  / kamrify  
https://github.com/kamranahmedse/deve...
  / roadmapsh