'Internal path length' diaporamas de présentation

Trees

407 views • 28 slides

IPR

Internal Path Reduction Tree. IPR. IPR Trees are with no doubt superior compared to AVL Trees.

189 views • 14 slides

BST addElement

BST addElement. To addElement(), we essentially do a find( ). When we reach a null pointer, we create a new node there. void addElement(Object el, BinaryTreeNode t) { if (t == null) t = new BinaryTreeNode(el, null, null); else if (el < t.element) addElement(el, t.left);

207 views • 9 slides