Ask Question

What is binary tree? Construct a binary tree using the inorder and postorder traversal of the node given below :

Inorder : D B F E A G C L J H K

Postorder : D F E B G L J K H C A

Added 3 years ago
Active
Viewed 1039
Data Structures & Algorithm Computer Science & Engineering
Ans

A binary tree consists of a finite set of element that can be partitioned into three distinct subset called root, the left and right sub tree. If there are no elements in the binary tree it is called an empty binary tree.

 

binary tree create



Subjects

Data Structures & Algorithm
41 questions
Database Management System
33 questions
Software Engineering
55 questions
Compiler Design
21 questions
Mobile computing
23 questions
Design and Analysis of Algorithm
12 questions
C Programming and Practices
37 questions
Computer Graphics and Multimedia
42 questions

Advertisements

Related Questions

In which cases, QuickSort becomes a ‘SlowSort’ ? What Is the remedy In those cases? 
2 years ago . by Demo Teacher

Discuss the differences between command file and executable file.
2 years ago . by Demo Teacher

What are the differences between AVL Tree & Binary Search Tree ?
2 years ago . by Demo Teacher

What is a minimum spanning tree ? Describe Huffman’s Algorithm.   
2 years ago . by Demo Teacher

MindStudy - a preparation hub for all the students. The goal is to make it easier for pupils to get better grades on exams.

Company

Legal Stuff

Help

Copyright © 2025 MindStudy

A product by Shunya Intelliware Solution
(Registered under MSME Uddyam)