Data Structures using C Part 21 - Binary trees in c language | Types of Binary Trees

Binary Trees : Binary tree is a special type of tree in which every node can have a maximum of 2 children. One is known as left child and the other is known as right child. A Binary Tree defined on a finite set of nodes that either – – contains no nodes, (Null tree or empty tree), or – is composed of three disjoint sets of nodes: a root node, a binary tree called its left subtree, and a binary tree called its right subtree. Types of Binary Trees : Complete Binary Tree Strictly Binary Tree Extended Binary Tree Complete Binary Tree : A binary tree in which every internal node has exactly two children and all leaf nodes are at same level is called Complete Binary Tree. At every level of complete binary tree there must be 2level number of nodes. Strictly Binary Tree A binary tree in which every node has either two or zero number of children is called Strictly Binary Tree. Strictly binary tree is also called as Full Binary Tree or Proper Binary Tree Extended Binary Tree : The Strictly binary tree obtained by adding dummy nodes to a binary tree is called as Extended Binary Tree. Representation of Binary Tree : Array Representation Linked List Representation ankpro ankpro training Asp.net MVC C# C sharp Bangalore Rajajinagar Selenium Coded UI Mobile automation testing Mobile testing JQuery JavaScript .Net C C++ Components of the .Net framework Hello World Literal Keywords Variable Data types Operators Branching Loops Arrays Strings Structures Enums Functions