Menu

Question Discussion & Solution

MCQ
Q.
What is wrong with below code for inorder traversal of inorder threaded binary tree:

inordertraversal(threadedtreenode root):
   threadedtreenode q = inorderpredecessor(root)
   while(q!=root):
   q=inorderpredecessor(q)
   print q.data

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
If a node having two children is deleted from a binary tree, it is replaced by its
forum Discussion
MCQ
2.
One can convert a binary tree into its mirror image by traversing it in
forum Discussion
MCQ
3.
A binary tree is a ________data structure; each node belongs to a particular level number.
forum Discussion
MCQ
4.
Unlike a general tree, each node in a binary tree is restricted to have at the most __________child nodes only.
forum Discussion
MCQ
5.
What is a complete binary tree?
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs