Interested to Buy Any Domain ? << Click Here >> for more details...
if there are n nodes in a binary tree, how many null
pointers are there?
- 4 Answers
- 23105 Views
- Hughes, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / anand prakash
If there are n nodes in a Binary Tree then number of null
pointers = n+1
| Is This Answer Correct ? | 58 Yes | 5 No |
Answer / fakkad
maximum(for complete binary tree) n+1
so total null pointers are <=n+1
It is equivalent to total number of leaf nodes.
| Is This Answer Correct ? | 8 Yes | 3 No |
Answer / sreenatha
let the binary tree be not symmetric , then it has n-1 edges
excluding the edges from deficient nodes(nodes that have
atmost one child) to NULL.
Suppose , the binary tree was perfectly symmetric (i.e,
every node including the root has exactly two children).
Then , the total no.of edges including the edges from leaf
nodes to NULL would be 2 * N .
So , required ans = 2*N - N-1 = N+1
| Is This Answer Correct ? | 8 Yes | 3 No |
How many processes can listen on a single TCP/IP port?
this question is from sas:what is the difference between FILE and INFILE statements? plz explain in brief?
what are other resources are needed for this mantis?
define profiler???
What is std::auto_ptr?
what do you meant by Platform-Independent in Java?
What is the difference between in-proc and out-of-proc?
EXPLAIN UNARY OPEARATORS
how sap is different from other software ?
Find out the roles which gives access to all tables in SAP? Thanks in advance.
why you have to became a software developer?
Given an array of size n+1 which contains all the numbers from 1 to n.Find the number which is repeated in O(n) time.How do you proceed with the same with floating numbers from 0 to 1 instead of 1 to n?
C 
