Tree terminology | Tree in data structure | Introduction to trees | Data structures

#treeterminologyindatastructure, #treeindatastructure, #thegatehub
Contact Datils (You can follow me at)

Watch Complete Playlists:

Root − The first node from where the tree originates is called as a root node.
In any tree, there must be only one root node.
Parent − Any node except the root node has one edge upward to a node called parent.
Child − The node below a given node connected by its edge downward is called its child node.
Siblings - Nodes which belong to the same parent are called as siblings.
Ancestor of node n - Any node y on the (unique) path from root r to node n is an ancestor of node n.
Descendent of n - Any node y for which n is an ancestor of y.
Degree - Degree of a node is the total number of children of that node.
Height - The height of a node N is the length of the LONGEST path from N to a leaf node.
Depth - Total number of edges from root node to a particular node is called as depth of that node.
Internal Node - The node which has at least one child is called as an internal node.
Leaf Node - The node which does not have any child is called as a leaf node.
Subtrees of node n - Subtrees of node n are the trees whose roots are the children of n.
Forest - A forest is a set of disjoint trees

types of trees in data structure, binary trees in data structure, tree in data structure pdf, binary search tree in data structure, avl tree in data structure
tree data structure in c, types of binary tree, what is graph in data structure
data structures,tutorial,playlist,lectures,trees,tree,terminology,tree terminologies, tree terminology in data structure, types of trees in data structure, properties of tree in data structure, tree basic terminology in data structure in hindi, binary tree representation in data structure, binary search tree in data structure, height of a node, depth of a node, height of a tree, depth of a tree, descendant node example, descendant in graph, descendant average c++, ancestors in binary tree leetcode, leaf node, query for ancestor-descendant relationship in a tree, ancestor node, what is ancestor of a node in a tree, height of a binary tree formula, how to find the height of a binary tree, height of a tree formula, find height of binary tree without recursion, height of root node, level of tree, depth of binary tree
maximum depth of binary tree python, degree of tree geeksforgeeks,
full binary tree, degree of a node, height of binary tree, types of binary tree
binary search tree, depth of a tree, a terminal node in a binary tree is called
how to find depth of binary tree, depth of binary tree formula in log, number of levels in a binary tree, maximum depth of binary tree python, maximum depth of binary tree javascript, height of root node, complete binary tree, give an algorithm for finding the height or depth of the binary tree
siblings in binary tree, binary tree in data structure, types of tree in data structure, full binary tree, representation of trees in data structure, what is leaf node in data structure, binary search tree, check if two nodes in a binary tree are siblings,

[Gs_Sharma]

Thank you so much sir
For helping before one day to exam

[amruthasparkling]

How height and depth is similar
As height of b=3
Depth of b=1