Download Tree data structures terminology and more Thesis Data Structures and Algorithms in PDF only on Docsity!
DATA STRUCTURES
UNIT 1
Introduction to Algorithm Performance Analysis Space Complexity Time Complexity Asymptotic Notations Linear & Non- Linear Data Structures Single Linked List Circular Linked List Double Linked List Arrays Sparse Matrix UNIT 2 Stack ADT Stack Using Array Stack Using Linked List Expressions Infix to Postfix Postfix Evaluation Queue ADT Queue Using Array Queue Using Linked List
Tree Terminology
In linear data structure, data is organized in sequential order and in non- linear data structure, data is organized in random order. Tree is a very popular data structure used in wide range of applications. A tree data structure can be defined as follows...
Tree is a non-linear data structure which organizes data in hierarchical structure and this is a recursive definition.
A tree data structure can also be defined as follows...
Tree data structure is a collection of data (Node) which is organized in hierarchical structure and this is a recursive definition
In tree data structure, every individual element is called as Node. Node in a tree data structure, stores the actual data of that particular element and link to next element in hierarchical structure.
In a tree data structure, if we have N number of nodes then we can have a maximum of N-1 number of links.
Example
Terminology
In a tree data structure, we use the following terminology...
1. Root
HOME SUBJECTS DOWNLOADS AUTHORS
CONTACT US
Circular Queue Double Ended Queue UNIT 3 Tree - Terminology
Tree Representations Binary Tree Binary Tree Representations Binary Tree Traversals Threaded Binary trees Max Priority Queue Max Heap Introduction to Graphs Graph Representations Graph Traversal - DFS Graph Traversal - BFS UNIT 4 Linear Search Binary Search Hashing Insertion Sort Selection Sort Radix Sort Quick Sort Heap Sort Comparison of Sorting Methods UNIT 5 Binary Search Tree AVL Trees B - Trees
In a tree data structure, the first node is called as Root Node. Every tree must have root node. We can say that root node is the origin of tree data structure. In any tree, there must be only one root node. We never have multiple root nodes in a tree.
2. Edge
In a tree data structure, the connecting link between any two nodes is called as EDGE. In a tree with 'N' number of nodes there will be a maximum of 'N-1' number of edges.
3. Parent
In a tree data structure, the node which is predecessor of any node is called as PARENT NODE. In simple words, the node which has branch from it to any other node is called as parent node. Parent node can also be defined as "The node which has child / children".
4. Child
In a tree data structure, the node which is descendant of any node is called as CHILD Node. In simple words, the node which has a link from its parent node is called as child node. In a tree, any parent node can have any number of child nodes. In a tree, all the nodes except root are child nodes.
8. Degree
In a tree data structure, the total number of children of a node is called as DEGREE of that Node. In simple words, the Degree of a node is total number of children it has. The highest degree of a node among all the nodes in a tree is called as 'Degree of Tree'
9. Level
In a tree data structure, the root node is said to be at Level 0 and the children of root node are at Level 1 and the children of the nodes which are at Level 1 will be at Level 2 and so on... In simple words, in a tree each step from top to bottom is called as a Level and the Level count starts with '0' and incremented by one at each level (Step).
10. Height
In a tree data structure, the total number of egdes from leaf node to a particular node in the longest path is called as HEIGHT of that Node. In a tree, height of the root node is said to be height of the tree. In a tree, height of all leaf nodes is '0'.
Previous
Next →
11. Depth
In a tree data structure, the total number of egdes from root node to a particular node is called as DEPTH of that Node. In a tree, the total number of edges from root node to a leaf node in the longest path is said to be Depth of the tree. In simple words, the highest depth of any leaf node in a tree is said to be depth of that tree. In a tree, depth of the root node is '0'.
12. Path
In a tree data structure, the sequence of Nodes and Edges from one node to another node is called as PATH between that two Nodes. Length of a Path is total number of nodes in that path. In below example the path A - B - E - J has length 4.
13. Sub Tree
In a tree data structure, each child from a node forms a subtree recursively. Every child node will form a subtree on its parent node.
About Us ¦ Contact Us
Website designed by RAJINIKANTH B
