0
a binary tree with right sub trees only
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
What is meant by left skewed binary tree?
a binary tree with only left sub trees is called as left skewed binary tree
What is meant by tree based parity check?
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.
What is meant by binary tree?
there is no shortcut for this anwer so in the related links box below I posted the wikipedia binary tree article. Check it out.
How many types of binary tree?
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
What is meant by the expression traversing by a binary tree?
you do anything with binary element that is traversing. insertion,deletion, accesing anything.............
What is an almost complete binary tree?
An almost complete binary tree is a tree in which each node that has a right child also has a left child. Having a left child does not require a node to have a right child. Stated alternately, an almost complete binary tree is a tree where for a right child, there is always a left child, but for a left child there may not be a right child.The number of nodes in a binary tree can be found using this formula: n = 2^h Where n is the amount of nodes in the tree, and h is the height of the tree.
What is the difference between extended binary tree and a binary search tree?
A strictly binary tree is one where every node other than the leaves has exactly 2 child nodes. Such trees are also known as 2-trees or full binary trees. An extended binary tree is a tree that has been transformed into a full binary tree. This transformation is achieved by inserting special "external" nodes such that every "internal" node has exactly two children.
How are you going to determine if a tree is a binary tree or not?
the tree is the finite set of element is called tree .the binary tree is the finite set of elements its include the parents, left children and right children
What is binary search in data structure using c?
a tree which has atmost two nodes is called binary tree binary search tree is a binary tree which satisfies the following 1.every node in tree must be distinct 2.values in right subtree > value at root 3.values in left subtree < value at root 4.left,right subtrees must be binary search trees
What is the number of nodes in a strictly binary tree which has n leaves?
IF EVERY NON-LEAF NODE IN A BINARY TREE HAS HAS NONEMPTY LEFT AND RIGHT SUBTREES, THE TREE IS TERMED AS A STRICTLY BINARY TREE. SUCH A TREE WITH n LEAVES ALWAYS CONTAINS 2n-1 NODES.
What is strictly binary tree?
If every non-terminal node (any node except root node whose degree is not zero) in a binary tree consists of non-empty left and right subtree, then such a tree is called strictly binary tree.
How can a binary tree be represented in a computer memory?
A binary tree is a tree that has at most two child node. It contain a data field, a pointer to the left and a pointer to the right child.
