Tell me why do tree always takes o(log n) time?
Submitted by: AdministratorTree always takes o(log n) time because tree has height is
(log n).
Submitted by: Administrator
(log n).
Submitted by: Administrator
Read Online OS Data Structures Job Interview Questions And Answers
Top OS Data Structures Questions
| ☺ | Explain real world example of polymorphism and encapsulation? |
| ☺ | What is AVL tree? |
| ☺ | Why enum can not be used directly with printf function? |
| ☺ | What is a complexity of linear search, binery search? |
| ☺ | What is difference between the run time polymorphism and compile time poly morphism and about virtual function? |
Top Operating System (OS) Categories
| ☺ | RTOS Interview Questions. |
| ☺ | Windows 7 Interview Questions. |
| ☺ | MAC Operating System Interview Questions. |
| ☺ | Disk Operating System (DOS) Interview Questions. |
| ☺ | Shell Scripting Interview Questions. |
