Data Structure Used: Binary Tree
Algorithm:(Done Will Post Soon)
Working Code:
Time Complexity O(n)
Space Complexity O(1)
Run Here
Monday, July 4, 2011
WAP to Find The Difference the between even-level-nodes sum & odd-level-nodes sum in binary tree consider root at 0th level which even level starting form 0th level
Example
Data Structure Used: Binary Tree
Algorithm:(Done Will Post Soon)
Working Code:
Time Complexity O(n)
Space Complexity O(1)
Run Here
Data Structure Used: Binary Tree
Algorithm:(Done Will Post Soon)
Working Code:
Time Complexity O(n)
Space Complexity O(1)
Run Here
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment