01-06-2012, 12:24 AM
An empty node in a binary tree is called null node and each node in a binary having two pointers left and right if a node has empty node(s) then their pointer(s) will be called null pointer. i.e each leaf node has two null pointers.
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]
