When implementing a two-way navigation tree with Linux,

Asked 1 years ago, Updated 1 years ago, 82 views

We've already implemented a binary tree in the input file You need to implement a code that finds the level with the highest number of nodes in that binary tree.

Set the input file (input.txt) in advance After making the chords with hw1.cpp, Like hw1<input.txt, I need to load input file and debug it To read input files from hw1.cpp What code do I need?

For example, In the input file, the first line is written with 269 (root node left child node right child node) So we're going to read this data and we're going to give you two as the root node, six as the left child node, and nine as the right child node What is it?

linux binary-search-tree input-file

2022-09-22 15:03

1 Answers

It was a question related to file I/O.

I think the way to input and output files with cpp has already been introduced in other blogs, so I will not write it down separately. Search on Google as follows ^

^

Google Search Link


2022-09-22 15:03

If you have any answers or tips


© 2024 OneMinuteCode. All rights reserved.