Question One: Code the Following: In Java, write, document, and test classes for: 1. 1. a generic binary tree 2. 2. an m-ary tree 3. 3. an expression tree. Use it to store the expression (2 + 4-3). 4. 5. 6. 7. should have null subtrees. 8. 5. Write and test Java code, given root, to: 4. an operating system's disk-directory tree and its contents. Each item in the directory should have a name and a reference to a subtree. An entry that is a file 9. 6. find the height of a tree 10. 7. count the leaves 11. 8. count the nodes 12. 9. tell whether the tree is balanced 13. 10. count the siblings of a node 14. 11. find the total number of nodes in a general tree 15. 2.4a Explain a tree traversal

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Please written by computer source 

Question One: Code the Following:
In Java, write, document, and test classes for:
1. 1. a generic binary tree
2. 2. an m-ary tree
3.
3. an expression tree. Use it to store the expression (2 + 4-3).
4.
5.
6.
7.
8.
9. 6. find the height of a tree
10. 7. count the leaves
4. an operating system's disk-directory tree and its contents.
Each item in the directory should have a name and a
reference to a subtree. An entry that is a file
should have null subtrees.
5. Write and test Java code, given root, to:
11. 8. count the nodes
12. 9. tell whether the tree is balanced
13. 10. count the siblings of a node
14. 11. find the total number of nodes in a general tree
15.2.4a Explain a tree traversal
B:
(1-3) Use a stack or queue library class, as appropriate, to:
1. check the nesting of parentheses, or braces
in a Java source file
2. check the nesting of tags, such as <html>, </html>, <p>, </p>
etc., in an HTML file.
3. implement a reverse Polish notation calculator.
4. Write a method that takes integer-stack and integer parameters
s and n, and returns the value of the nth item from the top of s,
leaving the stack intact.
5. Write a program that reads a Java program and outputs a file
with all method definitions removed. To accomplish this,
you must use a stack
Transcribed Image Text:Question One: Code the Following: In Java, write, document, and test classes for: 1. 1. a generic binary tree 2. 2. an m-ary tree 3. 3. an expression tree. Use it to store the expression (2 + 4-3). 4. 5. 6. 7. 8. 9. 6. find the height of a tree 10. 7. count the leaves 4. an operating system's disk-directory tree and its contents. Each item in the directory should have a name and a reference to a subtree. An entry that is a file should have null subtrees. 5. Write and test Java code, given root, to: 11. 8. count the nodes 12. 9. tell whether the tree is balanced 13. 10. count the siblings of a node 14. 11. find the total number of nodes in a general tree 15.2.4a Explain a tree traversal B: (1-3) Use a stack or queue library class, as appropriate, to: 1. check the nesting of parentheses, or braces in a Java source file 2. check the nesting of tags, such as <html>, </html>, <p>, </p> etc., in an HTML file. 3. implement a reverse Polish notation calculator. 4. Write a method that takes integer-stack and integer parameters s and n, and returns the value of the nth item from the top of s, leaving the stack intact. 5. Write a program that reads a Java program and outputs a file with all method definitions removed. To accomplish this, you must use a stack
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education