🌳Trees

The thing you are seeing is a tree. DOM(Document Object Model) is a tree. Even though it doesn't look like one. let's take a look at the tree representation of what you are seeing right now.

First, we have something called an HTML tag. Inside the HTML tag, there are two more tags called head and body. Inside head and body tags there are more tags. And again inside them, there are more tags. You can also notice that these tags are getting nested more and more. Each tag is connected to a previous tag without the first tag. And you might have noticed some hierarchy in here. This is what we call a tree data structure.

What is a tree data structure?

A tree data structure is a structure where each node is connected to a previous or parent node in a hierarchical order.

Ok. But that doesn't look like a tree. Let me prove it to you.

I hope this picture looks like a tree to you.

let's apply some CSS.

.tree {
    transform: rotate(180deg);
}

We have just rotated our tree to 180 degrees. But it is still a tree. We have just rotated our tree to 180 degrees.

Let's see the properties and features of trees.

• Node: You can think of a node as a leaf in a tree. A node is nothing but just an element of a tree.

• Root Node: A root node is a top node that you see in the tree. It does not have any previous node.

• Parent Node: The parent node is the immediate previous node connected to the current node. It is just like our real-life parents. A parent can have multiple children.

• Child Node: The child node is the children of the parent node. And that makes sense right. A child can also be a parent.

• Leaf Node: Less node is a child node but not a parent node. Or simply, a leaf node is a child node that no other node is connected to it from the bottom.

• Sibling Node: A sibling node is a child node connected to the same parent node. And that's what sibling means.

• Direction: The connection direction of a tree is always unidirectional or one way. It always goes from top to bottom. From root node to child node and its child node and so on. If you notice the picture you will get that.

• Edge: An edge in a tree is the connection between two nodes. Suppose the connection between you and your parent.

• Path: A path is nothing but consecutive edges between the source node to the given node.

• Ancestor Node: All the nodes that are in the path of a source node and the target node are called Ancestor nodes. Like your Father ----> GrandFather -----> Great GrandFather -----> so on

• Descendant Node: Every node in the path of your current node to the leaf nodes is called an ancestor node.

• Level: Count the number of edges in the path from the root node to your current node. That number of edges is called level.

• Depth of Node: From the root node to the given node path, count the number of edges. The total number of edges is the depth of that node.

• Height of Node: The total number of edges on the path from your current node to the most distant leaf node is the height of the node.

• Degree of a node: The total number of children of a node is the degree of a node.

• Height of Tree: Maximum number of edges from the root node to the leaf node. A tree might have many leaf nodes. But you have to look for the most distant node. Then count the edges.

Some facts about Tree

• The height of a tree is always equal to the level of the tree

• Number of edges in the tree = (n - 1) [where n is the total number of the tree]

Common types of tree Data Structures.

• General tree data

• Binary tree

• Binary Search Tree

• AVL tree

• Red-Black tree

• Splay tree

• Treap tree and ...so on

That's it for this blog.