edited by
700 views
0 votes
0 votes

Leaf Nodes =[ Internal nodes with degree 2 ] + 1

It is valid if we consider Tree as undirected graph ?

Or is it valid only for Tree when considered as directed graph

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
Kaluti asked Mar 29, 2018
361 views
given an array which contains the preorder traversal of full $k-ary$ tree. Give an algorithm for constructing the full $k-ary$ tree
0 votes
0 votes
1 answer
2
once_2019 asked Jun 24, 2018
609 views
Is the root node an internal node?
1 votes
1 votes
1 answer
3
rahul sharma 5 asked Apr 12, 2018
662 views
a:) If given Tree is BST = Inorder of keys is sortedb:) Inorder of keys is sorted = Tree is BST(converse of above)I know first one holds.Is second one also true?If not ca...
2 votes
2 votes
0 answers
4
LRU asked Nov 18, 2021
271 views
A tree with n nodes and the property that the heights of the two children of any node differ by at most 2 has O(log n) height.Please explain this statement to be true or ...