filmov
tv
#16 Tree Data Structure
Показать описание
In this video we will see :
- Tree data structure
- Example of Tree in Data Structure
- Branch
- Reference
- Edge
- Node
- Root node
- Leaf node
- Child node
- Sub node
- Types of Tree
- Binary Tree
- Strict Binary Tree
- Full Binary Tree
- Level of nodes
- Complete Binary Tree
- Height of tree
- Depth of tree
- Height of root node
Data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently.
Data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.
A tree is a widely used abstract data type (ADT) that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.
A tree data structure can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.
Editing Monitors :
Follow on Facebook:
Subscribe to our other channel:
Telusko Hindi :
Donation:
PayPal Id : navinreddy20
Patreon : navinreddy20
Комментарии