In this Unit we will Learn about Trees ADT and how to Implement them
Why to use Tree ADT. Theoretical understanding regarding its time has already been seen why we are using trees! Remember the time complexity in searching log (n) over the cost of insertion and deletion (o(n) ) . Have you observed on your computer how files are organized in a tree structure?
Fine!
Observe some other interesting applications of Trees!
Now let's start this journey by finding different possibilities with which we can make trees
See there are two scenarios - 1) if you are given some nodes without labels and
2) with labels
can you draw a number of binary trees possible in each case?
A binary tree is one which is having a degree of at most 2, thus nodes with degrees 0,1,2 are binary
can you draw a number of binary trees possible in each case?
A binary tree is one which is having a degree of at most 2, thus nodes with degrees 0,1,2 are binary
