Answer:
understanding the problem very well
writing documention to every piece of code you write
write clear and concise code
follow Industry accepted format for data storage
avoid recursion if possible
write modular code
Answer:
Some differences between Heap and Binary search trees are as following:-
A heap is a complete binary tree.While a Binary Search Tree may be a complete,prefect binary tree.
A minheap the root should be minimum than it's children So it efficient for finding minimum and maximum.While Binary search trees have different properties the root node should be greater than the left child and should be less than the right child.
Value or power of a network grows exponentially as a function of the number of network members. this is known as Metcalfe's law. According to this law <span>the value (the power) of a </span>telecommunications network<span> is </span>proportional to the square of the number of connected users of the system (network members). Metcalfe's Law <span>characterizes many of the </span>network effects<span> of communication technologies and networks such as the </span>Internet<span>, </span>social networking<span> and the </span>World Wide Web<span>.</span>
It think the answer to that question maybe true
