What Are Null Nodes Filled With In A Threaded Binary Tree?

› Category: Questions › What are null nodes filled with in a threaded binary tree?

Editor Staff asked 5 months ago

What are null nodes filled with in a threaded binary tree?

(a) inorder predecessor for left node and inorder successor for right node information

(b) right node with inorder predecessor and left node with inorder successor information

(c) they remain null

(d) some other values randomly

My doubt is from Threaded Binary Tree in chapter Binary Trees of Data Structures & Algorithms I

I got this question by my college director while I was bunking the class.

Question Tags: Interview-Questions-Answers

1 Answers

0 Vote Up Vote Down

Editor">

Editor Staff answered 5 months ago

Correct choice is (a) inorder predecessor for left node and inorder successor for right node information

The best I can explain: If preorder or postorder is used then the respective predecessor and successor info is stored.

Related Posts

Most commonly asked OpenAI interview questions and answers

Common AI interview questions and answers:

How do you uninstall gulp?