Which of the following statement is NOT true about threaded binary tree?

(A) Right thread of the right-most node points to the dummy node
(B) Left thread of the left-most node points to the dummy node
(C) The left pointer of dummy node points to the root node of the tree
(D) Left thread of the right-most node points to the dummy node

Which of the following statement is correct?

(A) A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor
(B) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor
(C) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor
(D) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor

error: Content is protected !!