recategorized by
4,839 views
19 votes
19 votes
State whether the following statements are TRUE or FALSE:

If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
recategorized by

3 Answers

Best answer
25 votes
25 votes
Condition for binary tree is atmost two immediate child for every internal node

No, it is not the condition for binary tree.
edited by
3 votes
3 votes

binary tree is made of nodes, where each node contains a "left" reference, a "right" reference, and a data element. The topmost node in thetree is called the root. Every node (excluding a root) in a tree is connected by a directed edge from exactly one other node. This node is called a parent.

Reference https://www.cs.cmu.edu/~adamchik/15-121/lectures/Trees/trees.html

There is no such condition so statement is false

2 votes
2 votes

False.

Example: skew binary tree

Image result for skew binary tree

Answer:

Related questions

31 votes
31 votes
5 answers
1
makhdoom ghaya asked Nov 9, 2016
6,445 views
State whether the following statements are TRUE or FALSE:It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
18 votes
18 votes
3 answers
2
makhdoom ghaya asked Nov 14, 2016
5,092 views
Construct a binary tree whose preorder traversal is$K\;L\;N\;M\;P\;R\;Q\;S\;T$and inorder traversal is$N\;L\;K\;P\;R\;M\;S\;Q\;T$
21 votes
21 votes
3 answers
3
makhdoom ghaya asked Nov 9, 2016
3,525 views
State whether the following statements are TRUE or FALSE:A relation $r$ with schema $(X, Y)$ satisfies the function dependency $X \rightarrow Y$, The tuples $\langle 1, 2...
14 votes
14 votes
2 answers
4
makhdoom ghaya asked Nov 9, 2016
3,887 views
State whether the following statements are TRUE or FALSE:The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.