0
//not sure if it is correct
bool isomorphic(struct Node* root1,struct Node* root2)
{
if(root1 root2->value)
return ( isomorphic(root1->left,root2->left) && isomorphic(root1->right,root2->right)
isomorphic(root1->right,root2->left) && isomorphic(root1->left,root2->right)
);
else return false;
}
What else can I help you with?
Definition of threaded binary tree?
A binary tree variant that allows fast traversal: given a pointer to a node in a threaded tree, it is possible to cheaply find its in-order successor (and/or predecessor).
1 sketch all binary tree with six pendent vertices?
A binary tree with six pendent vertices will have five internal nodes. The pendent vertices will be attached to these internal nodes. The tree will have a root node with two child nodes, each of which will have two child nodes, resulting in a total of six pendent vertices. The structure will resemble a balanced binary tree with a depth of two.
What is a metaphor about a tree?
Example:the tree is a cloud
How tall is a tree if woman is 5ft and her shadow is 4ft and near by tree shadow is 10ft?
The tree is 12.5 feet in height
Which design shape will generate the most thrust?
A tree with branches.
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 to find height of subtree in a Binary tree?
Check this out! http://stackoverflow.com/questions/575772/the-best-way-to-calculate-the-height-in-a-binary-search-tree-balancing-an-avl
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
Copy of binary tree?
Is another binary tree.
Are binary tree and binary tree same?
Yes.
Is a full binary tree the same as a complete binary tree, or are there differences between the two structures?
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.
When converting binary tree into extended binary tree all the original nodes in binary tree are?
will remain same
Does binary tree and binary search tree same?
no they are not same
What are the application of binary tree in computer science?
What are the applications of Binary Tree.
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 incomplete 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
