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 vector and types of vector?
What are the basic data structures?
Are data structures important?
Q#1: An algorithm is made up of 2 modules M1 and M2.If order of M1 is F(n) and order of M2 is g (n) then what is the order of the algorithm. Q # 2 : How many binary trees are possible with 3 nodes? with 4 nodes?
What is data structure and data type?
What is ordered map?
Which sorting is best in time complexity?
Is bubble sort slow?
Which interfaces are implemented by linkedlist?
How can you insert a node in a random location of the linked list?
To describe the Complexity of Binary search, Quicksort and various other sorting and searching techniques..
0 Answers HPCL, Hughes Systique Corporation,
What are linear and non linear data structures?