1. Engineering
  2. Computer Science
  3. please help me as soon as possible java 1 describe...

Question: please help me as soon as possible java 1 describe...

Question details


Please help me as soon as possible. (Java)


1 Describe, in pseudocode, a nonrecursive method for performing an inorder traversal of

a proper binary tree in linear time.

Hint: Use a stack

2. Find an pseudo-code to compute the height of an arbitrary tree based on the concept of depth. What is running time of your algorithm if the tree has n nodes.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution