1 votes 1 votes I have a confusion regarding the array implementation of binary tree ,i.e what are the index locations of the left child of a node whether it is 2i+1 or 2i and same for right child ,can anyone explain? DS data-structures + – Winner asked Mar 17, 2019 Winner 846 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Winner commented Mar 17, 2019 reply Follow Share Ok got it 0 votes 0 votes Shaik Masthan commented Mar 17, 2019 reply Follow Share no need of heap, if it is complete binary tree, we can happily use array representation. 1 votes 1 votes prashant jha 1 commented Mar 18, 2019 reply Follow Share :) 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Left child = 2i , right child = 2i+1 If array is start from index 1. abhishekmehta4u answered Mar 17, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.