Using _____ order we can delete tree nodes in such a way that a child node is deleted before its parents

A

Pre

B

Post

C

In

D

Level

উত্তরের বিবরণ

img

Answer: ) Post

Tree traversal orders:

Unfavorite

0

Updated: 2 days ago

Related MCQ

In Huffman coding, the algorithm repeatedly picks two nodes and merges those. These two nodes are:

Created: 2 days ago

A

with the highest frequency 

B

with the lowest frequency

C

one highest and one lowest frequency

D

picked arbitrarily

Unfavorite

0

Updated: 2 days ago

In Agile, Software is delivered: 

Created: 2 days ago

A

at the end of the project 

B

in small incremental iterations

C

after complete documentation

D

only when all features have been implemented

Unfavorite

0

Updated: 2 days ago

The bisection method is used to: 

Created: 2 days ago

A

Find the eigenvalue of a matrix

B

Solve a system of linear equation

C

Find roots of non-linear equations

D

Perform numerical integration

© LXMCQ, Inc. - All Rights Reserved

Developed by WiztecBD