you do anything with binary element that is traversing. insertion,deletion, accesing anything.............
It means you have to represent the tree graphically, much like a family tree, such that when traversing the tree you highlight the currently active node in some way.
a binary tree with only left sub trees is called as left skewed binary tree
a binary tree with right sub trees only
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 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
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.
Yes.
Is another binary tree.
will remain same
no they are not same
Using binary tree, one can create expression trees. The leaves of the expression tree are operands such as constants, variable names and the other node contains the operator (binary operator). this particular tree seems to be binary because all the operators used are binary operators. it is also possible for a node to have one node also, in case when a unary minus operator is used. we can evaluate an expression tree by applying the operator at the root to the values obtained by recursively evaluating the left and right sub trees.
What are the applications of Binary Tree.