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 |
How is any data structure application is classified among files?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
Why is reflection slower?
What do you mean by double hashing?
How can avl tree be useful in all the operations as compared to binary search tree?
Can an arraylist be null?
How do arrays work?
Define threaded binary tree.
What is homogeneous array?
How to pass in data structure exam?
What is data structure explain different types of data structures with examples?
Is quicksort greedy algorithm?