Question:

Published on: 29 May, 2024

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

Answer:

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.

Subjects

Trending

Random questions

29 May, 2024

**Write an program to generate Pascal’s triangle.**

29 May, 2024

**Implement Bubble Sort using C.**

29 May, 2024