answersLogoWhite

Top Answer
User Avatar
Wiki User
Answered 2010-08-11 12:07:33

// Author : SAGAR T.U, PESIT

#define TRUE 1

#define FALSE 0

int isStrictBinaryTree (struct tree * n)

{

if( n NULL ) return TRUE;

return FALSE;

}

001
๐Ÿ™
0
๐Ÿคจ
0
๐Ÿ˜ฎ
0
๐Ÿ˜‚
0
User Avatar

Your Answer

Still Have Questions?

Related Questions

You want a algorithm to convert tree to binary tree?

hahaha on your face *****


Algorithm to convert forest tree into binary tree in data structure?

The algorithm to convert a forest tree into a binary tree in data structure can be quite long. You will need to start out with [head] and end with [finish].


What is the difference between strictly binary tree and complete binary tree?

Complete Binary tree: -All leaf nodes are found at the tree depth level -All nodes(non-leaf) have two children Strictly Binary tree: -Nodes can have 0 or 2 children


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.


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 do you mean by strictly binary tree?

A strictly binary tree is a tree in which every node other than the leaf nodes has exactly two children. OR in the Graph Theory perspective a tree having it's root vertex with degree 2 and all other non-leaf vertex of degree 3 and leaf vertex of degree 1, is called as the strictly binary tree. it is also called as the 2-tree or full binary tree.


What is the Difference between strictly binary tree and extended binary 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 do you print all data in a Binary Search Tree?

By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.


Give you the algorithm of creating a new binary search tree using c?

i want to know how to give the algorithm password in a computer ?


Strictly binary tree with n leaves has nodes?

2n-1 nodes


What is an algorithm that computes the height of a Binary tree?

Because a binary trees height has nothing to do with the number of items in the tree you will have to find the longest branch by walking the tree node by node. When you get into the real world a "B tree" is used, if you get to these you will like them over binary (red/black) trees.


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


Algorithm to determine if a binary tree is complete binary?

There are many ways of checking for a complete binary tree. Here is one method:1. Do a level order traversal of the tree and store the data in an array2. If you encounter a nullnode, store a special flag value.3. Keep track of the last non-null node data stored in the array - lastvalue4. Now after the level order traversal, traverse this array up to the index lastvalue and check whether the flag value is encountered. If yes, then it is not a complete binary tree, otherwise it is a complete binary tree.


What is the difference between binary tree and threaded binary tree?

threaded binary tree and binary tree


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


Type 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.


When converting binary tree into extended binary tree all the original nodes in binary tree are?

will remain same


What is the time complexity of insertion sort algorithm?

It depends on whether the structure is a linked list or a binary tree. Linked lists are generally O(n), with an expected average of O(n/2). With binary trees, the average is O(log n) if the tree is balanced.


Does binary tree and binary search tree same?

no they are not same


What is the difference between extended binary tree and a binary search tree?

Binary search trees form an important sub class of binary trees. In an ordinary tree, the elements are not ordered in any way. A binary search tree is a binary tree which is either empty or in which the following criteria are satisfied.1. All keys of the left sub tree of the root are less than the root.2. All keys of the right sub tree of the root are greater than the root.3. The left and right sub tree of a binary search tree are binary search trees on once again.Extended binary tree: ---In an extended binary tree, the special nodes are added to a binary tree to make it complete binary tree. In extended binary tree each node must contain two child.


What are the application of binary tree in computer science?

What are the applications of Binary Tree.


Differentiate Complete binary tree vs full binary tree?

Full binary tree: every node other than the leaves all have 2 children Complete binary tree: Full binary tree with all leaves on at most two adjacent levels.


Which is faster binary tree or binary search tree?

A tree doesn't do anything so it has no speed...


Still have questions?