/*
 * Copyright (C) 2014 Pedro Vicente Gómez Sánchez.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.github.pedrovgs.problem36;

/**
 * Given an AVL (self balanced binary search tree), find the median. Remember you can't just take
 * the root element even if the tree is balanced because even with the tree balanced you don't know
 * if the median is exactly the root element on a left or right son.
 */
public class AvlTreeMedian {
}

@@ -645,16 +645,146 @@
 lem36;%0A%0A
+import com.github.pedrovgs.binarytree.BinaryNode;%0Aimport com.github.pedrovgs.problem15.BinaryTreeInOrder;%0Aimport java.util.List;%0A%0A
 /**%0A * G
@@ -1078,11 +1078,1181 @@
 Median %7B
+%0A%0A  BinaryTreeInOrder binaryTreeInOrder;%0A%0A  public AvlTreeMedian() %7B%0A    this.binaryTreeInOrder = new BinaryTreeInOrder();%0A  %7D%0A%0A  /**%0A   * Iterative algorithm used to find the median of an AVL. This algorithm is based on a property%0A   * of every AVL tree, you can get a sorted collection containing the elements of this tree using%0A   * an in order traversal. Using this property we can get a sorted collection of nodes and then%0A   * find the median. The complexity order of this algorithm is O(N) in time and space terms where%0A   * N%0A   * is the number of nodes in the tree.%0A   */%0A  public double find(BinaryNode%3CInteger%3E root) %7B%0A    if (root == null) %7B%0A      throw new IllegalArgumentException(%22You can't pass a null binary tree to this method.%22);%0A    %7D%0A%0A    List%3CBinaryNode%3CInteger%3E%3E sortedElements = binaryTreeInOrder.getIterative(root);%0A    double median = 0;%0A    if (sortedElements.size() %25 2 == 0) %7B%0A      median = (sortedElements.get(sortedElements.size() / 2).getData() + sortedElements.get(%0A          sortedElements.size() / 2 - 1).getData()) / 2;%0A    %7D else %7B%0A      median = sortedElements.get(sortedElements.size() / 2).getData();%0A    %7D%0A    return median;%0A  %7D
 %0A%7D%0A

Add iterative solution to problem 36