Menu

Question Discussion & Solution

MCQ
Q.
What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

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.
What would be the cost value for any answering node of a sub tree with root
forum Discussion
MCQ
2.
What is direct addressing?
forum Discussion
MCQ
3.
A tree in which, for every node, the difference between the height of its left subtree and right subtree is not more than one is
forum Discussion
MCQ
4.
A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be
forum Discussion
MCQ
5.
What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

checkSum(struct bin-treenode *root , int sum) :
  if(root==null)
    return sum as 0
  else :
     leftover_sum=sum-root_node-->value
     //missing
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