Group I

• size (provided for you)
• height
• sizeOdd - number of Nodes with an odd key
• isPerfectlyBalancedS - at each Node, do left and right subtrees have same size?
• isPerfectlyBalancedH - at each Node, do left and right subtrees have same height?
• isOddBalanced - at each Node, do left and right subtrees contain the same number of odd keys?
• isSemiBalancedI - is each Node semibalanced? leaf or else size(larger child) / size (smaller child) <= 2
• sizeAtDepth - number of nodes at a given depth
• sizeAboveDepth - number of nodes whose depth is < a given depth
• sizeBelowDepth - number of nodes whose depth is > a given depth

Group II

• removeOddSubtrees
• removeLeaves
• removeSingles
• removeDepth
• addZeroToSingles
• sizeAtHeight
• sizeAboveHeight
• sizeBelowHeight
• removeHeight