In the linked represen

Question

In the linked representation of binary tree, complexity of post order traversal is :

Options:

A . O(n)

B . O(log n)

C . O(nlog n)

D . O(n^2)

Answer: Option A

Submit Your Solution Below and Earn Points !

Next Question

More Questions on This Topic :

Question 1. Dynamic Programming fails for which of the following problems....

Question 2. Complexity of following segment of code is: for(i=n....

Question 3. Given 5 numbers X1, X2, X3, X4, X5. How many comparisons are ....

Question 4. A d-ary heap is a like a binary heap, but (with one possible ....

Question 5. Let a be a Fibonacci-heap with n elements that results from a....

Question 6. What will be the ordering of the vertices produced by TOPOLOGICAL SORT when it is run on the directed acyclic graph as s....run on the directed acyclic graph as shown below:

Question 7. For a heap of n nodes, maximum no. of nodes in the left subtre....

Question 8. The postfix string for the input (((A-(B+C))*D)$(E+F)) : ....

Question 9. Given 5 vertices, number of spanning trees possible are: ....

Question 10. Maximum worst case complexity of cycle detection in a directe....

Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)

Direction Sense Test Part 1 Reasoning (Hindi)

Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE

Cube & Cuboid Part 1 Reasoning (Hindi)

Data Interpretation (DI) Basic Concept Reasoning (Hindi)

Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)

Sail E0 free webinar Webinars

Real Numbers Part 7 Class 10 Maths

Real Numbers Part 1 Class 10 Maths

Polynomials Part 1 Class 10 Maths

DSP Combined 1 Free Revision Test SAIL JO E-0

GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0

BSP Plant Specific Review Test SAIL JO E-0

BSL Combined 1 Free Revision Test SAIL JO E-0

GFM Combined 1 Free Revision Test SAIL JO E-0