591 views
1 votes
1 votes

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
Rohit Gupta 8 asked Dec 25, 2017
1,149 views
If the average depth of a node in an $n$-node binary search tree is $O(\log{n})$, then the height of the tree is$O(n\log{n})$$O(n)$$O(\log{n})$$O(\sqrt(n\log{n}))$
4 votes
4 votes
1 answer
2
Shashank Chavan asked Jan 18, 2016
11,265 views
What's the difference between Binary tree height, level and depth? Sometimes it's confusing!Does there definition change according to question also, if mentioned?
3 votes
3 votes
4 answers
4
Keith Kr asked Sep 30, 2014
3,061 views
Which of the following are equal things when there is only one CPU in a system.A) Multiprogramming and MultitaskingB) Multiprocessing and MultiprogrammingC) Multitasking ...