Skip to main content

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.
 Binary tree, Definition and its properties - IncludeHelp
 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.
Full v.s. Complete Binary Trees


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.
Trees

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. 
Balanced Binary Tree - Problems - E-Olymp

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.
Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

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...
8 comments
Read more

Semaphores In Process Synchronization

   ⇰  Semaphores :-   Semaphore is actually a method or tool to prevent race condition. Race condition can cause loss of data or even deadlock situation. For prevention from these conditions, the semaphore is one of the method.  Semaphore was proposed by Dijkstra in 1965. Simaphore    is a very significant technique to manage concurrent processes.  Semaphore is useful tool in the prevention of race condition. But the use of semaphore never means a guarantee that a program is free from these problems.     Semaphore is an integer variable which is used in mutual exclusive manner by various concurrent cooperative processes in order to acheive synchronization. Hence semaphore is one of the way to achieve synchronization.  Semaphore is basically  a variable which is non-negative and shared between threads. This variable is used to solve the critical section problem and to achieve process synchronization in the multiprocess...
Post a Comment
Read more

DeadLock In Operating System

      ⇰  DEADLOCK :- As we know in a multiprogramming environment several processes may compete for a finite number of resources. If a process requests resources and if the resources are not available at that time, the process enters a state called  waiting state. Sometimes, a waiting process is never again able to change state or never out from waiting state, because the resources it has requested are held by or taken by other waiting processes before this process.This situation is called a Deadlock.     ⇰  DEADLOCK CHARACTERIZATION:- In a deadlock processes never finish executing and system resources are tied up  and also  preventing other jobs from starting. Here are some features that characterize deadlocks. A deadlock situation can arrive if the following four conditions hold simultaneously in any operating system :- 1. Mutual exclusion :- A process must hold at least one resource in a nonsharable mode so tha...
3 comments
Read more