there is no shortcut for this anwer so in the related links box below I posted the wikipedia binary tree article. Check it out.
a binary tree with only left sub trees is called as left skewed binary tree
a binary tree with right sub trees only
you do anything with binary element that is traversing. insertion,deletion, accesing anything.............
A binary tree is type of tree with finite number of elements and is divided into three main parts. the first part is called root of the tree and itself binary tree which exists towards left and right of the tree. There are a no. of binary trees and these are as follows : 1) rooted binary tree 2) full binary tree 3) perfect binary tree 4) complete binary tree 5) balanced binary tree 6) rooted complete binary tree
Is another binary tree.
Yes.
It is one of the type of parity checking methods. when the binary digits are formated as like the binary tree .Then calculate the parity from the root to each leaf node from left to right.
A full binary tree is a type of binary tree where each node has either 0 or 2 children. A complete binary tree is a binary tree where all levels are fully filled except possibly for the last level, which is filled from left to right. So, a full binary tree can be a complete binary tree, but not all complete binary trees are full binary trees.
will remain same
no they are not same
What are the applications of Binary Tree.
Incomplete Binary Tree is a type of binary tree where we do not apply the following formula: 1. The Maximum number of nodes in a level is 2