Menu

Question Discussion & Solution

MCQ
Q.
Visiting root node after visiting left and right sub-trees is called

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.
In which tree, the right NULL pointer of each node (not having a right child node) points to its in-order successor?
forum Discussion
MCQ
2.
In which traversal, the root node is visited after the traversal of its left subtree and before the traversal of its right subtree?
forum Discussion
MCQ
3.
Why to prefer red-black trees over AVL trees?
forum Discussion
MCQ
4.
Maximum number of nodes in a binary tree with height k, where root is height 0, is
forum Discussion
MCQ
5.
In pre-order traversal, the root node is visited before traversing its________subtrees.
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
Practice arrow_forward
article

Abstract data types

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Arrays

format_list_bulleted 134 MCQs
Practice arrow_forward
article

Lists

format_list_bulleted 166 MCQs
Practice arrow_forward
article

Stacks

format_list_bulleted 165 MCQs
Practice arrow_forward
article

Queues

format_list_bulleted 61 MCQs
Practice arrow_forward
article

Trees

format_list_bulleted 133 MCQs
Practice arrow_forward
article

Binary Trees

format_list_bulleted 120 MCQs
Practice arrow_forward
article

B Trees

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Heaps

format_list_bulleted 36 MCQs
Practice arrow_forward
article

Hash based structures

format_list_bulleted 7 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 157 MCQs
Practice arrow_forward
article

Mixed

format_list_bulleted 10 MCQs
Practice arrow_forward