20. oktober 2008 - 15:10
Der er
4 kommentarer og
1 løsning
Threaded BinarySearcTree
Nogen der kan forklare nedenstående, for mig ?
"A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node, and all left child pointers that would normally be null point to the inorder predecessor of the node"
20. oktober 2008 - 21:38
#1
Jeg tror at de mener at i.s.f. at lave:
1
2<
3
som:
val=2,smaller=@1,bigger=@3
val=1,smaller=null,bigger=null
val=3,smaller=null,bigger=null
saa laver man det som:
val=2,smaller=@1,bigger=@3
val=1,smaller=null,bigger=@2
val=3,smaller=@2,bigger=null