What is inorder successor and predecessor in threaded binary tree?
Answers
Answered by
0
https://goo.gl/search/What+is+inorder+successor+and+predecessor+in+threaded+binary+tree?
Threaded binary tree - Wikipedia Definition. A threaded binary tree defined as follows: "A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node (if it exists), and all left child pointers that would normally be null point to the inorder predecessor of the node."
Threaded binary tree - Wikipedia Definition. A threaded binary tree defined as follows: "A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node (if it exists), and all left child pointers that would normally be null point to the inorder predecessor of the node."
Similar questions