In the given binary tree, using array you can store the node 4 at which location?
1 2 3 - - 4 - - 5
Answer / phool chand
Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4
where LCn means Left Child of node n and RCn means Right Child of node n
| Is This Answer Correct ? | 0 Yes | 0 No |
What is difference between map and hashmap?
Which is faster arraylist or hashmap?
What's the difference between an array and vector?
Can arraylist store objects?
Write an algorithm to check if there is a loop in a doubly linked list.
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
Who invented quicksort?
What is binary tree used for?
Is binary tree a bst?
Is bubble sort slow?
Define disjoint set adt?
Can a hashset contain duplicates?