Please write a 300+ word paragraph to answer this:  If each node of a tree is large (i.e., contains a large amount of data), then available memory may be a limiting factor. What can be done to allow an extremely large tree with hundreds of thousands (or even millions) of nodes to be built and managed?

3. Please provide professionally crafted solutions to the following: 1. For the following tree B E F H N a. What are the leaves? b. What are the children of D? c. What is the depth of G? d. What is the degree of G? e. What are the ancestors of G? f. What are the descendants of G? g. What are the nodes on level 3? h. What is the height of the tree? i. What is the width of the tree? j. What is the degree of the tree? k. Enumerate the nodes in breadth-first order. 1. Enumerate the nodes in depth-first order. Write a BinaryTreeUtils class with the following methods: • size(tree) the number of nodes in the tree • height(tree) - the height of the tree

When compared to alternative data structures, such as a linked list or an array, the advantages of a binary search tree are clear.

Please show steps clearly