What is a threaded binary tree traversal?...

MCQ

What is a threaded binary tree traversal?

a binary tree traversal using stacks

a binary tree traversal using queues

a binary tree traversal using stacks and queues

a binary tree traversal without using stacks and queues

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called

AVL tree

Red-black tree

Lemma tree

None of the above

Discussion

MCQ

What is a complete binary tree?

Each node has exactly zero or two children

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

None of the mentioned

Discussion

MCQ

When to choose Red-Black tree, AVL tree and B-trees?

many inserts, many searches and when managing more items respectively

many searches, when managing more items respectively and many inserts respectively

sorting, sorting and retrieval respectively

retrieval, sorting and retrieval respectively

Discussion

MCQ

Which of the following code snippet is used to convert decimal to binary numbers?

public void convertBinary(int num)
{
     int bin[] = new int[50];
     int index = 0;
     while(num > 0)
     {
       bin[index++] = num%2;
       num = num/2;
     }
     for(int i = index-1;i >= 0;i--)
     {
       System.out.print(bin[i]);
     }
}

public void convertBinary(int num)
{
     int bin[] = new int[50];
     int index = 0;
     while(num > 0)
     {
       bin[++index] = num%2;
       num = num/2;
     }
     for(int i = index-1;i >= 0;i--)
     {
       System.out.print(bin[i]);
     }
}

public void convertBinary(int num)
{
     int bin[] = new int[50];
     int index = 0;
     while(num > 0)
     {
         bin[index++] = num/2;
         num = num%2;
     }
     for(int i = index-1;i >= 0;i--)
     {
         System.out.print(bin[i]);
     }
}

public void convertBinary(int num)
 {
     int bin[] = new int[50];
     int index = 0;
     while(num > 0)
     {
         bin[++index] = num/2;
         num = num%2;
     }
     for(int i = index-1;i >= 0;i--)
     {
         System.out.print(bin[i]);
     }
  }

Discussion

MCQ

Traversing a binary tree first root and then left and right subtrees called _______traversal.

inorder

preorder

postorder

none of these

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics