What Are Null Nodes Filled With In A Threaded Binary Tree #694
What are null nodes filled with in a threaded binary tree?
This multiple choice question (MCQ) is related to the book/course gs gs121 Data Structures and Algorithms. It can also be found in gs gs121 Binary Trees - Threaded Binary Tree - Quiz No.1.
What are null nodes filled with in a threaded binary tree?
inorder predecessor for left node and inorder successor for right node information
right node with inorder predecessor and left node with inorder successor information
they remain null
some other values randomly
Similar question(s) are as followings:
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes