Types of Binary Tree

As we know binary tree is special type of tree data structure used for data storage purposes. A binary tree has a special condition that each node can have a maximum of two children. There are many types of binary tree. following are common types of binary tree among them :-
i > Full or Strictly Binary Tree
ii > Complete Binary Tree.
iii > Perfect Binary tree.
iv > Balanced Binary Tree.
v > Skewed Binary Tree.

i > Full or strictly Binary Tree :- A Binary Tree is full if every node has 0 or 2 children. We can also say a full binary tree is a binary tree in which all nodes except leaves have two children.Full binary tree is also called as Strictly binary tree.

ii > Complete Binary Tree :- A Binary Tree is complete Binary Tree if all levels are completely filled except possibly the last level and All the last level leaf nodes are as left as possible.

iii > Perfect Binary tree :- A Binary tree is Perfect Binary Tree in which all internal nodes have two children and all leaves are at the same level.

iv > Balanced Binary Tree :- It is defined as a binary tree with the worst case height of O(log n) are called balanced binary tree. AVL tree is an example of balanced binary tree.

v > Skewed Binary Tree :- A skewed binary tree is a binary tree in which all the nodes except one node has one and only one child and the remaining node has no child. means a skewed binary tree is a binary tree of n nodes such that its depth is (n-1).

FOR BASIC CONCEPT OF TREE DATA STRUCTURE GO THROUGH THIS LINK :- https://priypurnea.blogspot.com/2020/04/basic-concept-of-trees-and-its-type-in.html

Share, Follow and please comment if you find anything incorrect, or to share more information about the topic discussed above.

Comments

Process & Its state And process control block :-

⇰ PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution. A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads. The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two ...

Process Scheduling And Types of Process Schedular :-

⇰ PROCESS SCHEDULING Process Scheduling is a task of Operating System that schedules processes of different states like new, ready, waiting, terminated and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time. ⏩ Followings are some objectives of Process Scheduling :- i > To increase the amount of users within acceptable response times. ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and give reference to the processes holding the key resources. ⇰ PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and allows multiple users to shar...

Definition of Stack and its algorithm with working process(data structure)

Stack A Stack is an ordered collection of items where the addition of items and the removal of existing items always takes place at the same end. This end is commonly referred to as the “top". * working method of stack :- i> Initially top=-1 ii> By increasing top pointer we can insert element in the stack. iii> when top=size of stack-1 then stack is full. iv> By decreasing the top pointer we can remove the element from stack. v> when top=-1 then the stack is empty. figure shows run time stack * The fundamental operations which are possible on a stack are:- 1. push operation (insertion). 2. pop operation (deletion). 3. peep opetation(extract informat...

Search This Blog