Using C++

Lab Work 04-1. Application of Binary Trees Note. Programming in C/C++, including ciostream>/kiostream.hs only A left-child-right-sibling binary tree (LCRS) is a binary tree used to store a general rooted ordered tree by the following consideration The first child of each node is its left sub-tree in LORSI The next sibling of each node is its right sub-tree in ACSI The transformation of a general rooted ordered tree into a LORS binary tree has been called the th transform Determine the data structures for general rooted ordered trees and binary trees Implement the Knuth transform in CC Show by examples that a post-order traversal of the originaitree is identical to the in-order traversal of the Knuth transform (END)