i hve a problem cosidaring a binary tree,it say da table represent a portion of a computer 's main memory containing a binary tree.each node consists of 3 cells,da 1st being data ,da 2nd being pointer 2 da node 's lyf child,and da 3rd being a pointer to the node 's right child.if da nil pointer is represented by 00 & da tree 's root pointer contains53,draw a pricture of da tree showing da data in eachnode?

addess contents
50 AA
51 56
52 00
53 BB
54 00
55 50
56 CC
57 00
58 00

Question

i hve a problem cosidaring a binary tree,it say da table represent a portion of a computer 's main memory containing a binary tree.each node consists of 3 cells,da 1st being data ,da 2nd being pointer 2 da node 's lyf child,and da 3rd being a pointer to the node 's right child.if da nil pointer is represented by 00 & da tree 's root pointer contains53,draw a pricture of da tree showing da data in eachnode?

addess      contents
50              AA
51             56
52             00
53             BB
54             00   
55             50
56             CC
57             00
58            00

anonymous · Answer

Not sure but here's my try

anonymous · Answer

isnt it this one?

    BB   //at mem loc. 53 its BB, next a null pointer and then a pointer to 50
   /   \
  null  AA  // at 50 its AA then one pointer to 56 and a null pointer
        /  \
      CC   null  //at 56 its CC and two null pointers
     /  \
  null  null

anonymous · Answer

You are absolutely right. I misread (one more time today... I must sleep more tonight) : I thought it was written that if a pointer is null it is redirected to the address 53...
SORRY :D

anonymous · Answer

yea i need to read it several times to be sure, its ok bro at least u tried !

anonymous · Answer

Cheers mate