Tree data structure | application of tree data structure
what is tree data structure.
Trees in data structure are a collection of nodes which forms a hierarchy in which the root is at the top and the branches expand in downward direction.
Tree data structure consists of nodes, root, parent, child, sibling, ancestor, descendant, internal nodes and many more.
Some of the good articles on Tree data structure are as follows
https://www.tutorialspoint.com/data_s...
https://www.geeksforgeeks.org/binary-...
In future videos i will also discuss about the binary tree and types of binary trees and tree traversal techniques.
tree data structure has a wide variety of applications. Some of the applications are as follows :
Store hierarchical data (example : file system in our computer)
Faster searching eg) binary search tree
B-trees and B+ trees are used to implement indexing in databases
Syntax tree is used in compilers
Routing algorithms
you can see my data structure tutorials playlist here :
• infix prefix postfix data structures ...
you can also follow my Instagram page below :
/ kumarbrijesh94
If you have any suggestions for future videos or on this trees video you can discuss in comments section below.
