Solve This (? + ? + ?=30)
If 1111=R, 2222=T, 3333=E, 4444=N Then 5555=?
Guess the Hindi Muhawara from the following whatsapp Emoticons?
Sweet, Medicine, Film, Girl, City, Car, Place, Doggy all are name same, guess which word it is?
Guess me who am I, I am the first on earth, the second in heaven...
Four Question, One Answer: One River Name, One Flower Name, One Film Name, One Actress Name?
A girl is blind, deaf, dumb and uneducated too. A boy loves her. How would he propose without touching her?
Which Indian cricketer is known as "Brown Bradman"?
Which of the countries has had a prime minister whose name featured the name of his country?
Which of the gulf city was a dependency of Bombay Presidency under British rule for almost a century?
Balanced binary tree insure that the search complexity O(logn) for all cases.
If tree is not balanced the worst case complexity can be O(n).
Given a binary tree print it in inward spiral order i.e first print level 1, then level n, then level 2, then n-1 and so on.
For Ex -
4 5 6 7
8 9 10 11 12 13 14 15
Print- 1 15 14 13 12 11 10 9 8 2 3 7 6 5 4
Guys can someone help me by describing the skip-list and why someone should use it over BST.
Binary tree need to fulfill following two conditions for being a heap –
* It should be a complete tree (i.e. all levels except last should be full).
* Every node’s value should be greater than or equal to its child node (considering max-heap).
C/C++ code would be helpful?
Forgot Your Password?
2018 © Queryhome